32 results on '"Zhibing, Liu"'
Search Results
2. Incentive Contract Design for Supply Chain Enterprise’s Pollution Abatement with Carbon Tax
- Author
-
Jing Yu, Chi Zhou, Yixin Wang, and Zhibing Liu
- Subjects
Mechanism design ,Carbon tax ,Article Subject ,General Mathematics ,Supply chain ,05 social sciences ,General Engineering ,chemistry.chemical_element ,02 engineering and technology ,Environmental economics ,Engineering (General). Civil engineering (General) ,Incentive ,chemistry ,Transfer payment ,0502 economics and business ,QA1-939 ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,050202 agricultural economics & policy ,Business ,TA1-2040 ,Marginal utility ,Carbon ,Mathematics ,Expected utility hypothesis - Abstract
This paper applies mechanism design to the supply chain enterprise’s pollution abatement problem with carbon tax. To maximize the government’s expected utility, an uncertain contract model is presented in the framework of principal-agent theory, where the government’s assessment of the supply chain enterprise’s carbon emission level is described as an uncertain variable. Afterwards, the equivalent model is provided to obtain the optimal contract for the uncertain pollution abatement problem. The results demonstrate that the supply chain enterprise’s optimal output decreases with the carbon emission level. Furthermore, the government’s optimal transfer payment decreases with the carbon emission level if the carbon tax is low. In contrast, if the carbon tax is high, the optimal transfer payment increases with the carbon emission level. In addition, an increase in the carbon emission level decreases the optimal utilities of both the government and the supply chain enterprise and also leads to the supply chain enterprise’s incremental marginal utility. Finally, we provide a numerical example, which illustrates the effectiveness and practicability of the proposed model.
- Published
- 2021
3. Analysis of Slope Stability with Imprecise Soil Properties Using Uncertain Sets
- Author
-
Xuejun Zhou, Zhibing Liu, Yi Tang, and Jie Li
- Subjects
0209 industrial biotechnology ,Safety factor ,Article Subject ,Differential equation ,lcsh:Mathematics ,General Mathematics ,General Engineering ,Uncertainty theory ,02 engineering and technology ,lcsh:QA1-939 ,Stability (probability) ,020901 industrial engineering & automation ,lcsh:TA1-2040 ,Slope stability ,0202 electrical engineering, electronic engineering, information engineering ,Applied mathematics ,020201 artificial intelligence & image processing ,Soil properties ,lcsh:Engineering (General). Civil engineering (General) ,Shear strength (discontinuity) ,Random variable ,Mathematics - Abstract
There are many uncertainties with respect to the assessment of slope stability, and those associated with soil properties should be given particular attention. The uncertainty theory provides an alternative to treat these uncertainties using parochial cognitive sources. A novel methodology is proposed to evaluate the stability of slopes based on an uncertain set. The soil properties involved in the deterministic methods, i.e., shear strength parameters and unit weight, are expressed as uncertain sets, and their membership functions can be assumed to be triangular or trapezoidal for a homogeneous or two-layered slope, respectively. The parameter values of membership functions are designed according to the means and variations of the soil properties, and then the expected safety factor can be calculated through the operational laws. Two numerical examples including a homogeneous slope and a two-layered slope illustrate the suitability of the proposed methodology. The relationship between the variation in the safety factor and the changes in the soil properties is investigated; moreover, the determination of the parameter values of membership is also discussed.
- Published
- 2019
4. Extremal Inverse Eigenvalue Problem for a Special Kind of Matrices
- Author
-
Zhibing Liu, Yeying Xu, Kanmin Wang, and Chengfeng Xu
- Subjects
Mathematics ,QA1-939 - Abstract
We consider the following inverse eigenvalue problem: to construct a special kind of matrix (real symmetric doubly arrow matrix) from the minimal and maximal eigenvalues of all its leading principal submatrices. The necessary and sufficient condition for the solvability of the problem is derived. Our results are constructive and they generate algorithmic procedures to construct such matrices.
- Published
- 2014
- Full Text
- View/download PDF
5. A Modified Gradient Based Algorithm for Solving Matrix Equations AXB+CXTD=F
- Author
-
Kanmin Wang, Zhibing Liu, and Chengfeng Xu
- Subjects
Mathematics ,QA1-939 - Abstract
In this paper, we develop a modified gradient based algorithm for solving matrix equations AXB+CXTD=F. Different from the gradient based method introduced by Xie et al., 2010, the information generated in the first half-iterative step is fully exploited and used to construct the approximate solution. Theoretical analysis shows that the new method converges under certain assumptions. Numerical results are given to verify the efficiency of the new method.
- Published
- 2014
- Full Text
- View/download PDF
6. Research on multi-sensor measurement system and evaluation method for roundness and straightness errors of deep-hole parts
- Author
-
Chen Hui, zhibing Liu, Ci Song, and Xibin Wang
- Subjects
business.industry ,System of measurement ,Evaluation methods ,Computer vision ,Artificial intelligence ,Deep hole ,business ,Roundness (object) ,Mathematics ,Multi sensor - Abstract
Precision deep-hole parts are widely used in various fields of industrial production and their machining quality has a great impact on fatigue limit, geometric accuracy, and stability of products. Since roundness and straightness errors are essential technical indexes to evaluate the machining quality of deep-hole parts, accurate measurement and effective evaluation of them are of great significance to ensure the performance of related products. A multi-sensor integrated device that can measure two kinds of shape errors simultaneously was developed based on laser displacement sensor, two-dimensional position-sensitive detector, angle sensor, and laser distance sensor. Aiming at the problem of roundness error evaluation, the solution process of the control points of the minimum zone circle was optimized by calculating the distance between points and searching according to the polygon removal rule. Besides, the rotating projection method was used to evaluate the straightness error effectively. Eventually, the effectiveness of the measuring device and the shape error evaluation method was verified by experimental research.
- Published
- 2021
7. Robustness of Hopfield Neural Networks Described by Differential Algebraic Systems of Index-1 under the Conditions of Deviation Argument and Stochastic Disturbance
- Author
-
Zhibing Liu, Zuqiao Yang, Ping Li, and Qing Liu
- Subjects
Artificial neural network ,Article Subject ,General Mathematics ,Interval (mathematics) ,Upper and lower bounds ,Stability (probability) ,Noise ,Exponential stability ,Control theory ,Robustness (computer science) ,QA1-939 ,Differential (mathematics) ,Mathematics - Abstract
Robustness refers to the ability of a system to maintain its original state under a continuous disturbance conditions. The deviation argument (DA) and stochastic disturbances (SDs) are enough to disrupt a system and keep it off course. Therefore, it is of great significance to explore the interval length of the deviation function and the intensity of noise to make a system remain exponentially stable. In this paper, the robust stability of Hopfield neural network (VPHNN) models based on differential algebraic systems (DAS) is studied for the first time. By using integral inequalities, expectation inequalities, and the basic control theory method, the upper bound of the interval of the deviation function and the noise intensity are found, and the system is guaranteed to remain exponentially stable under these disturbances. It is shown that as long as the deviation and disturbance of a system are within a certain range, there will be no unstable consequences. Finally, several simulation examples are used to verify the effectiveness of the approach and are described below.
- Published
- 2021
- Full Text
- View/download PDF
8. A Note on Kantorovich Inequality for Hermite Matrices
- Author
-
Kanmin Wang, Chengfeng Xu, and Zhibing Liu
- Subjects
Mathematics ,QA1-939 - Published
- 2011
- Full Text
- View/download PDF
9. An updated full-discretization milling stability prediction method based on the higher-order Hermite-Newton interpolation polynomial
- Author
-
Zhibing Liu, Yan Zhenghu, Yongjian Ji, Xibin Wang, and Hongjun Wang
- Subjects
0209 industrial biotechnology ,Polynomial ,Hermite polynomials ,Discretization ,Mechanical Engineering ,02 engineering and technology ,Interval (mathematics) ,01 natural sciences ,Industrial and Manufacturing Engineering ,Computer Science Applications ,020901 industrial engineering & automation ,Rate of convergence ,Control and Systems Engineering ,Control theory ,Hermite interpolation ,0103 physical sciences ,Applied mathematics ,Spline interpolation ,010301 acoustics ,Software ,Mathematics ,Interpolation - Abstract
Chatter is undesirable self-excited vibrations, which always lead to adverse effects during milling process. Selecting a reasonable combination of cutting parameters is an effective way to avoid chatter. Based on the mathematical model of milling process and the Floquet theory, the stable cutting area can be determined. The stability lobe diagrams (SLD) could be obtained by different interpolation methods. To study the effect of higher order interpolation methods on the accuracy and efficiency of milling stability prediction, the state item, the time-delayed item, and the periodic-coefficient item of the state-space equation are approximated by different higher order interpolation methods, respectively. The calculations show that when the state item is approximated by the third-order Hermite interpolation polynomial, third-order Newton interpolation of the time-delayed item can improve the accuracy of SLD, while higher order interpolation of periodic-coefficient item has negative effect on improving effectiveness and efficiency compared to high-order interpolation of the state item and the time-delayed item. In order to obtain the SLD of milling process more accurately, an updated full-discretization milling stability prediction method which based on the third-order Hermite-Newton interpolation polynomial approximation is proposed in this paper. By dividing the tooth passing period equally into a finite set of time intervals, the third-order Hermite interpolation polynomial and the third-order Newton interpolation polynomial are utilized in each time interval to estimate the state item and the time-delayed item, respectively. The comparison of convergence rate of the critical eigenvalues and the SLD of the proposed method between the existing methods is carried out. The results indicate that the proposed method show a faster convergence rate than that of other methods, and its SLD is more close to the ideal ones with small number of time intervals.
- Published
- 2017
10. On Several Matrix Kantorovich-Type Inequalities
- Author
-
Kanmin Wang, Zhibing Liu, and Linzhang Lu
- Subjects
Mathematics ,QA1-939 - Abstract
We present several matrix Kantorovich-type inequalities, which improve the results obtained in Liu and Neudecker (1996). Elementary methods suffice to prove the inequalities.
- Published
- 2010
- Full Text
- View/download PDF
11. Assessment of slope stability under uncertain circumstances
- Author
-
Zhibing Liu, Xuejun Zhou, Huiru Chen, and Wenxiong Huang
- Subjects
0209 industrial biotechnology ,Safety factor ,Computational complexity theory ,02 engineering and technology ,Expected value ,Stability (probability) ,Instability ,Theoretical Computer Science ,020901 industrial engineering & automation ,Control theory ,Slope stability ,Slope stability probability classification ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Geometry and Topology ,Software ,Reliability (statistics) ,Mathematics - Abstract
Slope stability assessment is a difficult geotechnical problem because of the many uncertainties involved. The uncertainties associated with soil parameters are significant, originating from limited and imprecise information, which allows for the soil parameters to be expressed as uncertain variables. The distributions of these uncertain variables are built on the basis of the structure of the soil layers of a slope, and the safety factor of slope stability is defined as a ratio of resisting and acting moments under uncertain environments. The expected value of the safety factor is therefore calculated by utilizing the operational laws of the uncertain variables. The concept of the reliability index of slope stability is also introduced in order to evaluate the risk of slope instability. Three numerical examples, including a homogeneous slope and two non-homogeneous slopes, are used to verify the proposed model; meanwhile, the results are compared with those of the Fellenius method. The numerical results indicate that the proposed model can not only improve the reliability of the calculated safety factor but also reduce the computational complexity compared to deterministic methods. Fifteen project instances taken from the literature are used to investigate the validity of reliability index, and the results illustrate that the reliability index is another useful indicator to assess the stability of a slope.
- Published
- 2017
12. Third-order updated full-discretization method for milling stability prediction
- Author
-
Li Jiao, Yongjian Ji, Dongqian Wang, Yan Zhenghu, Xibin Wang, and Zhibing Liu
- Subjects
State-transition matrix ,0209 industrial biotechnology ,Polynomial ,Series (mathematics) ,Discretization ,Mechanical Engineering ,02 engineering and technology ,Stability (probability) ,Industrial and Manufacturing Engineering ,Computer Science Applications ,Matrix (mathematics) ,020303 mechanical engineering & transports ,020901 industrial engineering & automation ,0203 mechanical engineering ,Rate of convergence ,Control and Systems Engineering ,Control theory ,Applied mathematics ,Software ,Interpolation ,Mathematics - Abstract
Based on third-order Newton interpolation polynomial and direct integration scheme (DIS), this paper proposes a method to generate stability lobe diagram in milling process. The dynamic model of milling process with consideration of regeneration effect is described by time periodic delay-differential equation (DDE). Then, the DDE is rewritten as state space equation by a transformation. After equally discretizing the time delay into a series of small time intervals, the state space equation of milling system is integrated on the small time interval. Both the state term and delayed term are interpolated by third-order Newton interpolation polynomial, and the periodic-coefficient matrix is interpolated by first-order Newton interpolation polynomial. The state transition matrix which reflects the discrete mapping relation of dynamic responses for current tooth pass period and immediate previous tooth pass period is obtained directly. The accuracy of the proposed method is evaluated by comparing with benchmark methods in terms of the rate of convergence. The efficiency of the proposed method is verified through the comparison of computational time with existing methods. The proposed method is proved to be an accurate and efficient method by the comparison results. The distinction between up-milling and down-milling operations is also analyzed by comparing the stability lobe diagrams for these two operations. Besides, according to the analysis of rate of convergence, the number of substitutions, which are used to convert the variables located out of the required range into the required range, may affect the results of stability lobe diagrams. Moreover, the stability lobe diagram cannot be generated by using fourth-order updated full-discretization method.
- Published
- 2017
13. Orthogonal polynomial approximation method for stability prediction in milling
- Author
-
Dongqian Wang, Yongjian Ji, Li Jiao, Yan Zhenghu, Xibin Wang, and Zhibing Liu
- Subjects
0209 industrial biotechnology ,Chebyshev polynomials ,Mechanical Engineering ,Mathematical analysis ,02 engineering and technology ,021001 nanoscience & nanotechnology ,Industrial and Manufacturing Engineering ,Computer Science Applications ,Matrix polynomial ,Reciprocal polynomial ,020901 industrial engineering & automation ,Control and Systems Engineering ,Stable polynomial ,Orthogonal polynomials ,0210 nano-technology ,Chebyshev nodes ,Legendre polynomials ,Software ,Monic polynomial ,Mathematics - Abstract
Based on orthogonal polynomial approximation scheme, this paper presents several stability prediction methods using different kinds of orthogonal polynomials. The milling dynamics with consideration of the regenerative effect is described by time periodic delay-differential equations (DDEs). Firstly, this work employs the classical Legendre and Chebyshev polynomials to approximate the state term, delayed term, and periodic-coefficient matrix. With the help of direct integration scheme (DIS), the state transition matrixes which indicate the mapping relations of the dynamic response between the current tooth pass and the previous tooth pass are obtained. The stability lobe diagrams for single degree of freedom (DOF) and two DOF milling models are generated by using the Legendre and Chebyshev polynomial approximation-based methods. The rate of convergence of the Legendre and Chebyshev polynomial-based methods is compared with that of the benchmark first-order semi-discretization method (1stSDM). The comparison results indicate that the rate of convergence and the numerical stability of the Legendre and Chebyshev polynomial-based methods are both need to be improved. In order to develop new methods with high rate of convergence and numerical stability base on DIS, the monic orthogonal polynomial sequences are constructed by using Gram-Schmidt orthogonalization to approximate the state term, delayed term, and periodic-coefficient matrix. The rate of convergence and the computational efficiency of the monic orthogonal polynomial-based methods are evaluated by comparing with those of the benchmark 1stSDM. The results turn out that the monic orthogonal polynomial-based methods are advantageous in terms of the rate of convergence and numerical stability. The stability lobe diagrams for single DOF and two DOF milling models obtained by the monic orthogonal polynomial-based methods are compared with those obtained by the 1stSDM. Finally, the monic orthogonal polynomial-based methods are proved to be the effective and efficient methods to predict the milling stability.
- Published
- 2017
14. Hochschild Homology Groups of System Quiver Algebras of Maximal Tame Type
- Author
-
Chunling He, Zhibing Liu, and Huiru Chen
- Subjects
Discrete mathematics ,Pure mathematics ,Hochschild homology ,010102 general mathematics ,Quiver ,010103 numerical & computational mathematics ,0101 mathematics ,Type (model theory) ,01 natural sciences ,Mathematics - Published
- 2017
15. Extremal inverse eigenvalue problem for symmetric doubly arrow matrices
- Author
-
Kanmin Wang, Zhibing Liu, and Chengfeng Xu
- Subjects
Combinatorics ,Computational Mathematics ,Pure mathematics ,Matrix (mathematics) ,Applied Mathematics ,Theory of computation ,Inverse ,Block matrix ,Nonnegative matrix ,Divide-and-conquer eigenvalue algorithm ,Constructive ,Eigenvalues and eigenvectors ,Mathematics - Abstract
In this paper, we consider the following inverse eigenvalue problem: to construct a real symmetric doubly arrow matrix A from the minimal and maximal eigenvalues of all its leading principal submatrices. The necessary and sufficient condition for the solvability of the problem is derived. We also give a necessary and sufficient condition in order that the constructed matrices can be nonnegative. Our results are constructive and they generate algorithmic procedures to construct such matrices.
- Published
- 2013
16. Hochschild Homology Groups of System Quiver Algebras of Minimal Wild Type
- Author
-
Fang He, Huixia Wang, Zhibing Liu, and Guiju Liu
- Subjects
Pure mathematics ,Hochschild homology ,Mathematics::Rings and Algebras ,Quiver ,Wild type ,Representation (systemics) ,Hochschild homology group ,Physics and Astronomy(all) ,Type (model theory) ,Mathematics::K-Theory and Homology ,System quiver algebra ,Bimodule ,Minimal projective bimodule resolution ,Mathematics::Representation Theory ,Mathematics - Abstract
In the paper, based on the the minimal projective bimodule resolutions of the system quiver algebras of minimal wild representation type, we calculate explicitly the dimensions of all Hochschild homology groups of the system quiver algebras of minimal wild representation type by means of combinatorics.
- Published
- 2012
17. The inverse eigenvalue problem of generalized reflexive matrices and its approximation
- Author
-
Kanmin Wang, Linzhang Lu, and Zhibing Liu
- Subjects
Algebra ,Computational Mathematics ,Generalized inverse ,Applied Mathematics ,Reflexivity ,Calculus ,Natural science ,Foundation (engineering) ,Inverse ,Divide-and-conquer eigenvalue algorithm ,Eigenvalues and eigenvectors ,Mathematics - Abstract
National Natural Science Foundation of China [10961010]; Natural Science Foundation of Jiangxi, China [2007GZS1760]; Jiangxi education office, China [GJJ08432]
- Published
- 2011
18. A Modified Gradient Based Algorithm for Solving Matrix Equations AXB+CXTD=F
- Author
-
Chengfeng Xu, Zhibing Liu, and Kanmin Wang
- Subjects
Matrix (mathematics) ,Article Subject ,Gradient based algorithm ,lcsh:Mathematics ,Applied Mathematics ,Conjugate gradient method ,Applied mathematics ,lcsh:QA1-939 ,Approximate solution ,Algorithm ,Gradient method ,Mathematics - Abstract
In this paper, we develop a modified gradient based algorithm for solving matrix equationsAXB+CXTD=F. Different from the gradient based method introduced by Xie et al., 2010, the information generated in the first half-iterative step is fully exploited and used to construct the approximate solution. Theoretical analysis shows that the new method converges under certain assumptions. Numerical results are given to verify the efficiency of the new method.
- Published
- 2014
- Full Text
- View/download PDF
19. Extremal Inverse Eigenvalue Problem for a Special Kind of Matrices
- Author
-
Chengfeng Xu, Zhibing Liu, Yeying Xu, and Kanmin Wang
- Subjects
Combinatorics ,Pure mathematics ,Matrix (mathematics) ,Article Subject ,Applied Mathematics ,lcsh:Mathematics ,Inverse ,Block matrix ,Divide-and-conquer eigenvalue algorithm ,lcsh:QA1-939 ,Constructive ,Eigenvalues and eigenvectors ,Mathematics - Abstract
We consider the following inverse eigenvalue problem: to construct a special kind of matrix (real symmetric doubly arrow matrix) from the minimal and maximal eigenvalues of all its leading principal submatrices. The necessary and sufficient condition for the solvability of the problem is derived. Our results are constructive and they generate algorithmic procedures to construct such matrices.
- Published
- 2014
20. The Inverse Eigenvalue Problem of Generalized Reflexive Matrices
- Author
-
Hong Bao, Yeying Xu, and Zhibing Liu
- Subjects
Pure mathematics ,Matrix (mathematics) ,Integer matrix ,Hamiltonian matrix ,Generalized eigenvector ,Mathematical analysis ,Symmetric matrix ,Single-entry matrix ,Nonnegative matrix ,Involutory matrix ,Mathematics - Abstract
A real symmetric unipotent matrix P is said to be n×n generalized reflection matrix. A real matrix A is said to be a generalized reflexive matrix with respect to generalized reflection matrix dual (P, Q) if A = PAQ. This paper involves related inverse eigenvalue problems of generalized reflexive matrices and their optimal approximation. Necessary and sufficient conditions for the solvability of the problem are derived, the general expression of the solution is given. The optimal approximate solution is also provided.
- Published
- 2012
21. Existence and Construction of Nonnegative Matrices with Pure Image Spectrum
- Author
-
Kanmin Wang, Zhibing Liu, and Fanghong Jian
- Subjects
Combinatorics ,Matrix (mathematics) ,Stochastic matrix ,Nonnegative matrix ,Involutory matrix ,Centrosymmetric matrix ,Metzler matrix ,Complex number ,Matrix multiplication ,Mathematics - Abstract
The nonnegative inverse eigenvalue problem (NIEP) is the problem of determining necessary and sufficient conditions for a list of complex numbers ¦O to be the spectrum of a nonnegative matrix. In this paper the problem is completely solved in the case when all numbers in the given list except for one (the Perron eigenvalue) are pure image numbers. Lets. Let ( ,bi, bi,,b i, b i)be a list of complex numbers with ¦N,bj > 0 for j =1,2,,k . A simple necessary and sufficient conditions for the existence of an entry wise nonnegative 2k +1 order matrix A with spectrum ¦O are presented , and the proof is elementary.
- Published
- 2012
22. Left and Right Inverse Eigenpairs Problem of Generalized Anti-reflexive Matrices and Its Approximation
- Author
-
Kanmin Wang, Yan Li, and Zhibing Liu
- Subjects
Integer matrix ,Matrix (mathematics) ,Hamiltonian matrix ,Matrix splitting ,Mathematical analysis ,Applied mathematics ,Symmetric matrix ,Nonnegative matrix ,Involutory matrix ,Eigendecomposition of a matrix ,Mathematics - Abstract
A real symmetric unipotent matrix P is said to be generalized anti-reflection matrix. A real matrix A is said to be a generalized anti-reflexive matrix with respect to generalized reflection matrix dual (P, Q) if A =-PAQ. In this paper, the left and right inverse eigenpairs problems for generalized anti-reflexive matrices are considered. We obtain the necessary and sufficient conditions for the solvability of the problem and we present the general expression of the solution. The related optimal approximation problem to a given matrix over the solution set is solved. In addition, a numerical algorithm and examples to solve the problem are given.
- Published
- 2011
23. The linear weighting method for solving a class of non-differentiable multiobjective programming problem
- Author
-
Zhibing Liu, Fang He, Guiju Liu, and Huixia Wang
- Subjects
Class (computer programming) ,Mathematical optimization ,Multiobjective programming ,Differentiable function ,Multi-objective optimization ,Programming profession ,Mathematics ,Weighting - Abstract
In the paper, we put forward the linear weighting method for solving a type of non-differentiable multiobjective programming problem, and use it to solve an example.
- Published
- 2011
24. The generalized reflexive solutions of the matrix equation AX = B
- Author
-
Kanmin Wang, Chengfeng Xu, and Zhibing Liu
- Subjects
Matrix difference equation ,Matrix differential equation ,Pure mathematics ,Hollow matrix ,Matrix function ,Mathematical analysis ,Symmetric matrix ,Block matrix ,Nonnegative matrix ,Single-entry matrix ,Mathematics - Abstract
In this paper, we consider the generalized reflexive solutions of the matrix equation AX = B. The necessary and sufficient conditions for the solvability of the problem are given, moreover, a simple and eigenvector-free formula of the general solution to the matrix equation is presented using Moore-Penrose generalized inverses of the coefficient matrix A. In addition, in corresponding solution set of the equation, the explicit expression of the nearest matrix to a given matrix in the Frobenius norm has been provided.
- Published
- 2011
25. An Inverse Eigenvalue Problem for a Special Kind of Matrices
- Author
-
Baidi Chen, Zhibing Liu, and Kanmin Wang
- Subjects
Integer matrix ,Pure mathematics ,Matrix (mathematics) ,Higher-dimensional gamma matrices ,Mathematical analysis ,Inverse ,Symmetric matrix ,Matrix analysis ,Eigenvalues and eigenvectors ,Matrix multiplication ,Mathematics - Abstract
In this paper we study a kind of inverse eigen value problem for a special kind of real symmetric matrices: the real symmetric Arrow-plus-Jacobi matrices. That is, matrices which look like arrow matrices forward and Jacobi backward, from the (p,p)station, 1 ? p ? n. We give a necessary and sufficient condition for the existence of such two matrices. Our results are constructive, in the sense that they generate an algorithmic procedure to construct the matrix.
- Published
- 2011
26. The Inverse Eigenvalue Problem for a Special Kind of Matrices
- Author
-
Chengfeng Xu, Zhibing Liu, and Kanmin Wang
- Subjects
Integer matrix ,Gell-Mann matrices ,Pure mathematics ,Matrix (mathematics) ,Higher-dimensional gamma matrices ,ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION ,Mathematical analysis ,MathematicsofComputing_NUMERICALANALYSIS ,Matrix analysis ,Divide-and-conquer eigenvalue algorithm ,Matrix multiplication ,Eigenvalues and eigenvectors ,Mathematics - Abstract
In this paper we study a kind of inverse eigenvalue problem for a special kind of real symmetric matrices: the real symmetric Arrow-plus-Jacobi matrices. That is, matrices which look like arrow matrices forward and Jacobi backward, from the station, . We give a necessary and sufficient condition for the existence of such two matrices. Our results are constructive, in the sense that they generate an algorithmic procedure to construct the matrix.
- Published
- 2011
27. On the Construction of Positive Definite Doubly Arrow Matrix from Two Eigenpairs
- Author
-
Kanmin Wang, Chengfeng Xu, and Zhibing Liu
- Subjects
Combinatorics ,symbols.namesake ,Pure mathematics ,Matrix (mathematics) ,Matrix function ,Symmetric rank-one ,symbols ,Symmetric matrix ,Nonnegative matrix ,Involutory matrix ,Centrosymmetric matrix ,Hilbert matrix ,Mathematics - Abstract
A class of inverse eigenvalue problem is proposed for real symmetric positive definite Arrow matrices. Necessary and sufficient conditions for the existence of a unique solution of this problem, as well as the analytic formula of this solution are derived, Our results are on structive, in the sense that they generate an algorithmic procedure to construct the matrix.
- Published
- 2011
28. A Note on Kantorovich Inequality for Hermite Matrices
- Author
-
Chengfeng Xu, Kanmin Wang, and Zhibing Liu
- Subjects
Kantorovich inequality ,Hermite polynomials ,Inequality ,Applied Mathematics ,media_common.quotation_subject ,lcsh:Mathematics ,MathematicsofComputing_NUMERICALANALYSIS ,Mathematics::Classical Analysis and ODEs ,Type inequality ,lcsh:QA1-939 ,law.invention ,Algebra ,Invertible matrix ,law ,ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION ,Discrete Mathematics and Combinatorics ,Analysis ,Mathematics ,media_common - Abstract
A new Kantorovich type inequality for Hermite matrices is proposed in this paper. It holds for the invertible Hermite matrices and provides refinements of the classical results. Elementary methods suffice to prove the inequality.
- Published
- 2011
29. On the Construction of Positive Definite Arrow Matrix from Two Eigenpairs
- Author
-
Kanmin Wang, Chengfeng Xu, and Zhibing Liu
- Subjects
Matrix (mathematics) ,Class (set theory) ,Pure mathematics ,Mathematical analysis ,Symmetric matrix ,Inverse ,Positive-definite matrix ,Inverse problem ,Eigenvalues and eigenvectors ,Matrix decomposition ,Mathematics - Abstract
A class of inverse eigenvalue problem is proposed for real symmetric positive definite Arrow matrices. Necessary and sufficient conditions for the existence of a unique solution of this problem, as well as the analytic formula of this solution are derived.
- Published
- 2010
30. The Wiener-Askey Polynomial Chaos for Diffusion Problems with Uncertainty
- Author
-
Zhibing Liu, Dong Qu, and Chuanju Xu
- Subjects
CHAOS (operating system) ,Partial differential equation ,Polynomial chaos ,Exponential convergence ,Mathematical analysis ,Convergence (routing) ,State (functional analysis) ,Diffusion (business) ,Galerkin method ,Mathematics - Abstract
Efficient methods based on Galerkin projections and the Wiener-Askey polynomial chaos are constructed to solve the steady/unsteady state diffusion problems with uncertainty. Some numerical examples are used to confirm the efficiency of the methods. The exponential convergence of the methods is demonstrated for each problem.
- Published
- 2010
31. Fuzzy Correlation Analysis, With an Application to the Transient Well Test
- Author
-
Ciyuan Xiao, Zhibing Liu, and Rongxing Hu
- Subjects
Correlation ,Fuzzy clustering ,Data point ,Fuzzy set ,Effective method ,Transient (computer programming) ,Data mining ,Time series ,computer.software_genre ,Well test ,computer ,Mathematics - Abstract
One purpose of a well test is to get reservoir parameters. The problem is how to analyze the transient well test parameters and find relationship between them. We present an effective method to analyze the correlation between the well test interpretation parameters, which is a combination of grey correlation analysis and fuzzy clustering. In particular, we use grey correlation analysis to describe the correlation between parameters, and use fuzzy clustering method to divide them into different categories according to the degree of the correlation between all parameters. A simple example shows the algorithmic strategies to implementing them. In the example, we consider six parameters and each of them contains 92 data points. The example presented in this paper shows that it's a flexible and cost-effective quantitative analysis method for transient test parameters analysis, it is particularly suitable for analyze relevance of time series data.
- Published
- 2008
32. On Several Matrix Kantorovich-Type Inequalities
- Author
-
Kanmin Wang, Zhibing Liu, and Linzhang Lu
- Subjects
Matrix (mathematics) ,Pure mathematics ,lcsh:Mathematics ,Applied Mathematics ,Discrete Mathematics and Combinatorics ,Type (model theory) ,lcsh:QA1-939 ,Analysis ,Mathematics - Abstract
We present several matrix Kantorovich-type inequalities, which improve the results obtained in Liu and Neudecker (1996). Elementary methods suffice to prove the inequalities.
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.