This paper aims to propose a fourth-order matrix spectral problem involving four potentials and generate an associated Liouville integrable hierarchy via the zero curvature formulation.A bi-Hamiltonian formulation is ...This paper aims to propose a fourth-order matrix spectral problem involving four potentials and generate an associated Liouville integrable hierarchy via the zero curvature formulation.A bi-Hamiltonian formulation is furnished by applying the trace identity and a recursion operator is explicitly worked out,which exhibits the Liouville integrability of each model in the resulting hierarchy.Two specific examples,consisting of novel generalized combined nonlinear Schrodinger equations and modified Korteweg-de Vries equations,are given.展开更多
In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.1...In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.134:108344,2022).The convergence analysis of the proposed method is established,which can improve the existing results.Numerical examples show that the proposed method is efficient with the two-step technique.展开更多
We present an eight component integrable Hamiltonian hierarchy, based on a reduced seventh order matrix spectral problem, with the aim of aiding the study and classification of multicomponent integrable models and the...We present an eight component integrable Hamiltonian hierarchy, based on a reduced seventh order matrix spectral problem, with the aim of aiding the study and classification of multicomponent integrable models and their underlying mathematical structures. The zero-curvature formulation is the tool to construct a recursion operator from the spatial matrix problem. The second and third set of integrable equations present integrable nonlinear Schrödinger and modified Korteweg-de Vries type equations, respectively. The trace identity is used to construct Hamiltonian structures, and the first three Hamiltonian functionals so generated are computed.展开更多
A class of matrix inverse problems minimizing ‖A-‖ F on the linear manifold l A=｛A∈R n×m ｜‖AX-B‖ F=min｝ is considered. The perturbation analysis of the solution to these problems is carried out. Th...A class of matrix inverse problems minimizing ‖A-‖ F on the linear manifold l A=｛A∈R n×m ｜‖AX-B‖ F=min｝ is considered. The perturbation analysis of the solution to these problems is carried out. The perturbation upper bounds of the solution are given for both the consistent and inconsistent cases. The obtained preturbation upper bounds are with respect to the distance from the perturbed solution to the unperturbed manifold.展开更多
In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear ...In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear in the theory of Riemann -Hilbert approach to asymptotic analysis for orthogonal polynomials on a real interval introduced by Fokas, Its, and Kitaev and on the unit circle introduced by Baik, Deift, and Johansson. The author hopes that their characterization may be applied to asymptotic analysis for general orthogonal polynomials by combining with a new extension of steepest descent method which we are looking for.展开更多
Censider the solutions of the matrix inverse problem, which are symmetric positive semide finite on a subspace. Necessary and sufficient conditions for the solvability, as well as the general solution are obtained. Th...Censider the solutions of the matrix inverse problem, which are symmetric positive semide finite on a subspace. Necessary and sufficient conditions for the solvability, as well as the general solution are obtained. The best approximate solution by the above solution set is given. Thus the open problem in [1] is solved.展开更多
A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping ...A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping matrix is decomposed into the sum of a proportional-and a nonproportional-damping parts, and the solutions of the real modal eigenproblem with the proportional dampings are determined, which are a set of initial approximate solutions of the complex modal eigenproblem. Second, by taking the nonproportional-damping part as a small modification to the proportional one and using the matrix perturbation analysis method, a set of approximate solutions of the complex modal eigenvalue problem can be obtained analytically. The result is quite simple. The new method is applicable to the systems with viscous dampings-which do not deviate far away from the proportional-damping case. It is particularly important that the solution technique be also effective to the systems with heavy, but not over, dampings. The solution formulas of complex modal eigenvlaues and eigenvectors are derived up to second-order perturbation terms. The effectiveness of the perturbation algorithm is illustrated by an exemplar numerical problem with heavy dampings. In addition, the practicability of approximately estimating the complex modal eigenvalues, under the proportional-damping hypothesis, of damped vibration systems is discussed by several numerical examples.展开更多
The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2...The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.展开更多
This paper considers the updating problem of the hyperbolic matrix factorizations. The sufficient conditions for the existence of the updated hyperbolic matrix factorizations are first provided. Then, some differentia...This paper considers the updating problem of the hyperbolic matrix factorizations. The sufficient conditions for the existence of the updated hyperbolic matrix factorizations are first provided. Then, some differential inequalities and first order perturbation expansions for the updated hyperbolic factors are derived. These results generalize the corresponding ones for the updating problem of the classical QR factorization obtained by Jiguang SUN.展开更多
For the expected value formulation of stochastic linear complementarity problem, we establish modulus-based matrix splitting iteration methods. The convergence of the new methods is discussed when the coefficient matr...For the expected value formulation of stochastic linear complementarity problem, we establish modulus-based matrix splitting iteration methods. The convergence of the new methods is discussed when the coefficient matrix is a positive definite matrix or a positive semi-definite matrix, respectively. The advantages of the new methods are that they can solve the large scale stochastic linear complementarity problem, and spend less computational time. Numerical results show that the new methods are efficient and suitable for solving the large scale problems.展开更多
We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is forme...We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is formed on the basis of any of the possible algorithms for determining the distances between DNA chains, as well as any specific object of study. At the same time, for example, the practical programming results show that on an average modern computer, it takes about a day to build such a 30 × 30 matrix for mnDNAs using the Needleman-Wunsch algorithm;therefore, for such a 300 × 300 matrix, about 3 months of continuous computer operation is expected. Thus, even for a relatively small number of species, calculating the distance matrix on conventional computers is hardly feasible and the supercomputers are usually not available. Therefore, we started publishing our variants of the algorithms for calculating the distance between two DNA chains, then we publish algorithms for restoring partially filled matrices, i.e., the inverse problem of matrix processing. Previously, we used the method of branches and boundaries, but in this paper we propose to use another new algorithm for restoring the distance matrix for DNA chains. Our recent work has shown that even greater improvement in the quality of the algorithm can often be achieved without improving the auxiliary heuristics of the branches and boundaries method. Thus, we are improving the algorithms that formulate the greedy function of this method only. .展开更多
This paper studies the eigenfunction expansion method to solve the two dimensional （2D） elasticity problems based on the stress formulation. The fundamental system of partial differential equations of the 2D problem...This paper studies the eigenfunction expansion method to solve the two dimensional （2D） elasticity problems based on the stress formulation. The fundamental system of partial differential equations of the 2D problems is rewritten as an upper tri angular differential system based on the known results, and then the associated upper triangular operator matrix matrix is obtained. By further research, the two simpler com plete orthogonal systems of eigenfunctions in some space are obtained, which belong to the two block operators arising in the operator matrix. Then, a more simple and conve nient general solution to the 2D problem is given by the eigenfunction expansion method. Furthermore, the boundary conditions for the 2D problem, which can be solved by this method, are indicated. Finally, the validity of the obtained results is verified by a specific example.展开更多
A variety of matrix rational interpolation problems include the partial realizationproblem for matrix power series and the minimal rational interpolation problem for generalmatrix functions.Several problems in circuit...A variety of matrix rational interpolation problems include the partial realizationproblem for matrix power series and the minimal rational interpolation problem for generalmatrix functions.Several problems in circuit theory and digital filter design can also be re-duced to the solution of matrix rational interpolation problems[1—4].By means of thereachability and the observability indices of defined pairs of matrices,Antoulas,Ball,Kang and Willems solved the minimal matrix rational interpolation problem in[1].On展开更多
The inverse spectral theory of a class of Atkinson-type Sturm-Liouville problems with non-self-adjoint boundary conditions containing the spectral parameter is investigated.Based on the so-called matrix representation...The inverse spectral theory of a class of Atkinson-type Sturm-Liouville problems with non-self-adjoint boundary conditions containing the spectral parameter is investigated.Based on the so-called matrix representations of such problems and a special class of inverse matrix eigenvalue problems,some of the coefficient functions of the corresponding Sturm-Liouville problems are constructed by using priori known two sets of complex numbers satisfying certain conditions.To best understand the result,an algorithm and some examples are posted.展开更多
In this paper, we consider the Goldbach＇s problem for matrix rings, namely, we decompose an n × n （n 〉 1） matrix over a principal ideal domain R into a sum of two matrices in Mn,（R） with given determinants....In this paper, we consider the Goldbach＇s problem for matrix rings, namely, we decompose an n × n （n 〉 1） matrix over a principal ideal domain R into a sum of two matrices in Mn,（R） with given determinants. We prove the following result： Let n 〉 1 be a natural number and A = （aij） be a matrix in Mn（R）. Define d（A） ：= g.c.d{aij}. Suppose that p and q are two elements in R. Then （1） If n 〉 1 is even, then A can be written as a sum of two matrices X, Y in Mn（R） with det（X） = p and det（Y） = q if and only if d（A） [ p - q; （2） If n 〉 1 is odd, then A can be written as a sum of two matrices X, Y in Mn（R） with det（X） = p and det（Y） = q if and only if d（A） ｜ p ＋ q. We apply the result to the matrices in Mn（Z） and Mn（Q[x]） and prove that if R = 7. or Q[x], then any nonzero matrix A in Mn（R） can be written as a sum of two matrices in Mn（R） with prime determinants.展开更多
The penalty equation of LCP is transformed into the absolute value equation, and then the existence of solutions for the penalty equation is proved by the regularity of the interval matrix. We propose a generalized Ne...The penalty equation of LCP is transformed into the absolute value equation, and then the existence of solutions for the penalty equation is proved by the regularity of the interval matrix. We propose a generalized Newton method for solving the linear complementarity problem with the regular interval matrix based on the nonlinear penalized equation. Further, we prove that this method is convergent. Numerical experiments are presented to show that the generalized Newton method is effective.展开更多
In this paper,by means of constructing the linear complementarity problems into the corresponding absolute value equation,we raise an iteration method,called as the nonlinear lopsided HSS-like modulus-based matrix spl...In this paper,by means of constructing the linear complementarity problems into the corresponding absolute value equation,we raise an iteration method,called as the nonlinear lopsided HSS-like modulus-based matrix splitting iteration method,for solving the linear complementarity problems whose coefficient matrix in R^(n×n)is large sparse and positive definite.From the convergence analysis,it is appreciable to see that the proposed method will converge to its accurate solution under appropriate conditions.Numerical examples demonstrate that the presented method precede to other methods in practical implementation.展开更多
We study a special class of lower trigonometric matrix value boundary value problems on hyperbolas. Firstly, the pseudo-orthogonal polynomial on hyperbola is given in bilinear form and it is shown that it is the only ...We study a special class of lower trigonometric matrix value boundary value problems on hyperbolas. Firstly, the pseudo-orthogonal polynomial on hyperbola is given in bilinear form and it is shown that it is the only one. Secondly, a special boundary value problem of lower triangular matrix is presented and transformed into four related boundary value problems. Finally, Liouville theorem and Painlevé theorem and pseudo-orthogonal polynomials are used to give solutions.展开更多
The present work deals with the calculation of transition probability between two diabatic potentials coupled by any arbitrary coupling. The method presented in this work is applicable to any type of coupling while fo...The present work deals with the calculation of transition probability between two diabatic potentials coupled by any arbitrary coupling. The method presented in this work is applicable to any type of coupling while for numerical calculations we have assumed the arbitrary coupling as Gaussian coupling. This arbitrary coupling is expressed as a collection of Dirac delta functions and by the use of the transfer matrix technique the transition probability from one diabatic potential to another diabatic potential is calculated. We examine our approach by considering the case of two constant potentials coupled by Gaussian coupling as an arbitrary coupling.展开更多
基金supported in part by NSFC under Grants 12271488, 11975145 and 11972291the Ministry of Science and Technology of China (G2021016032L and G2023016011L)the Natural Science Foundation for Colleges and Universities in Jiangsu Province (17 KJB 110020)
文摘This paper aims to propose a fourth-order matrix spectral problem involving four potentials and generate an associated Liouville integrable hierarchy via the zero curvature formulation.A bi-Hamiltonian formulation is furnished by applying the trace identity and a recursion operator is explicitly worked out,which exhibits the Liouville integrability of each model in the resulting hierarchy.Two specific examples,consisting of novel generalized combined nonlinear Schrodinger equations and modified Korteweg-de Vries equations,are given.
基金supported by the Scientific Computing Research Innovation Team of Guangdong Province(no.2021KCXTD052)the Science and Technology Development Fund,Macao SAR(no.0096/2022/A,0151/2022/A)+3 种基金University of Macao(no.MYRG2020-00035-FST,MYRG2022-00076-FST)the Guangdong Key Construction Discipline Research Capacity Enhancement Project(no.2022ZDJS049)Technology Planning Project of Shaoguan(no.210716094530390)the ScienceFoundation of Shaoguan University(no.SZ2020KJ01).
文摘In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.134:108344,2022).The convergence analysis of the proposed method is established,which can improve the existing results.Numerical examples show that the proposed method is efficient with the two-step technique.
文摘We present an eight component integrable Hamiltonian hierarchy, based on a reduced seventh order matrix spectral problem, with the aim of aiding the study and classification of multicomponent integrable models and their underlying mathematical structures. The zero-curvature formulation is the tool to construct a recursion operator from the spatial matrix problem. The second and third set of integrable equations present integrable nonlinear Schrödinger and modified Korteweg-de Vries type equations, respectively. The trace identity is used to construct Hamiltonian structures, and the first three Hamiltonian functionals so generated are computed.
文摘A class of matrix inverse problems minimizing ‖A-‖ F on the linear manifold l A=｛A∈R n×m ｜‖AX-B‖ F=min｝ is considered. The perturbation analysis of the solution to these problems is carried out. The perturbation upper bounds of the solution are given for both the consistent and inconsistent cases. The obtained preturbation upper bounds are with respect to the distance from the perturbed solution to the unperturbed manifold.
基金RFDP of Higher Education(20060486001)NNSF of China(10471107)
文摘In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear in the theory of Riemann -Hilbert approach to asymptotic analysis for orthogonal polynomials on a real interval introduced by Fokas, Its, and Kitaev and on the unit circle introduced by Baik, Deift, and Johansson. The author hopes that their characterization may be applied to asymptotic analysis for general orthogonal polynomials by combining with a new extension of steepest descent method which we are looking for.
文摘Censider the solutions of the matrix inverse problem, which are symmetric positive semide finite on a subspace. Necessary and sufficient conditions for the solvability, as well as the general solution are obtained. The best approximate solution by the above solution set is given. Thus the open problem in [1] is solved.
文摘A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping matrix is decomposed into the sum of a proportional-and a nonproportional-damping parts, and the solutions of the real modal eigenproblem with the proportional dampings are determined, which are a set of initial approximate solutions of the complex modal eigenproblem. Second, by taking the nonproportional-damping part as a small modification to the proportional one and using the matrix perturbation analysis method, a set of approximate solutions of the complex modal eigenvalue problem can be obtained analytically. The result is quite simple. The new method is applicable to the systems with viscous dampings-which do not deviate far away from the proportional-damping case. It is particularly important that the solution technique be also effective to the systems with heavy, but not over, dampings. The solution formulas of complex modal eigenvlaues and eigenvectors are derived up to second-order perturbation terms. The effectiveness of the perturbation algorithm is illustrated by an exemplar numerical problem with heavy dampings. In addition, the practicability of approximately estimating the complex modal eigenvalues, under the proportional-damping hypothesis, of damped vibration systems is discussed by several numerical examples.
基金supported in part by the Social Science Foundation of Ministry of Education(07JJD790154)the National Science Foundation for Young Scholars (60803076)+2 种基金the Natural Science Foundation of Zhejiang Province (Y6090211)Foundation of Education Department of Zhejiang Province (20070590)the Young Talent Foundation of Zhejiang Gongshang University
文摘The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1120150711171361)the Natural Science Foundation Project of CQ CSTC(Grant No.2010BB9215)
文摘This paper considers the updating problem of the hyperbolic matrix factorizations. The sufficient conditions for the existence of the updated hyperbolic matrix factorizations are first provided. Then, some differential inequalities and first order perturbation expansions for the updated hyperbolic factors are derived. These results generalize the corresponding ones for the updating problem of the classical QR factorization obtained by Jiguang SUN.
文摘For the expected value formulation of stochastic linear complementarity problem, we establish modulus-based matrix splitting iteration methods. The convergence of the new methods is discussed when the coefficient matrix is a positive definite matrix or a positive semi-definite matrix, respectively. The advantages of the new methods are that they can solve the large scale stochastic linear complementarity problem, and spend less computational time. Numerical results show that the new methods are efficient and suitable for solving the large scale problems.
文摘We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is formed on the basis of any of the possible algorithms for determining the distances between DNA chains, as well as any specific object of study. At the same time, for example, the practical programming results show that on an average modern computer, it takes about a day to build such a 30 × 30 matrix for mnDNAs using the Needleman-Wunsch algorithm;therefore, for such a 300 × 300 matrix, about 3 months of continuous computer operation is expected. Thus, even for a relatively small number of species, calculating the distance matrix on conventional computers is hardly feasible and the supercomputers are usually not available. Therefore, we started publishing our variants of the algorithms for calculating the distance between two DNA chains, then we publish algorithms for restoring partially filled matrices, i.e., the inverse problem of matrix processing. Previously, we used the method of branches and boundaries, but in this paper we propose to use another new algorithm for restoring the distance matrix for DNA chains. Our recent work has shown that even greater improvement in the quality of the algorithm can often be achieved without improving the auxiliary heuristics of the branches and boundaries method. Thus, we are improving the algorithms that formulate the greedy function of this method only. .
基金supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China (No. 20070126002)the National Natural Science Foundation of China (No. 10962004)
文摘This paper studies the eigenfunction expansion method to solve the two dimensional （2D） elasticity problems based on the stress formulation. The fundamental system of partial differential equations of the 2D problems is rewritten as an upper tri angular differential system based on the known results, and then the associated upper triangular operator matrix matrix is obtained. By further research, the two simpler com plete orthogonal systems of eigenfunctions in some space are obtained, which belong to the two block operators arising in the operator matrix. Then, a more simple and conve nient general solution to the 2D problem is given by the eigenfunction expansion method. Furthermore, the boundary conditions for the 2D problem, which can be solved by this method, are indicated. Finally, the validity of the obtained results is verified by a specific example.
基金The works is supported by the National Natural Science Foundation of China(19871054)
文摘A variety of matrix rational interpolation problems include the partial realizationproblem for matrix power series and the minimal rational interpolation problem for generalmatrix functions.Several problems in circuit theory and digital filter design can also be re-duced to the solution of matrix rational interpolation problems[1—4].By means of thereachability and the observability indices of defined pairs of matrices,Antoulas,Ball,Kang and Willems solved the minimal matrix rational interpolation problem in[1].On
基金Supported by the National Natural Science Foundation of China (12261066, 11661059)the Natural Science Foundation of Inner Mongolia (2021MS01020)。
文摘The inverse spectral theory of a class of Atkinson-type Sturm-Liouville problems with non-self-adjoint boundary conditions containing the spectral parameter is investigated.Based on the so-called matrix representations of such problems and a special class of inverse matrix eigenvalue problems,some of the coefficient functions of the corresponding Sturm-Liouville problems are constructed by using priori known two sets of complex numbers satisfying certain conditions.To best understand the result,an algorithm and some examples are posted.
文摘In this paper, we consider the Goldbach＇s problem for matrix rings, namely, we decompose an n × n （n 〉 1） matrix over a principal ideal domain R into a sum of two matrices in Mn,（R） with given determinants. We prove the following result： Let n 〉 1 be a natural number and A = （aij） be a matrix in Mn（R）. Define d（A） ：= g.c.d{aij}. Suppose that p and q are two elements in R. Then （1） If n 〉 1 is even, then A can be written as a sum of two matrices X, Y in Mn（R） with det（X） = p and det（Y） = q if and only if d（A） [ p - q; （2） If n 〉 1 is odd, then A can be written as a sum of two matrices X, Y in Mn（R） with det（X） = p and det（Y） = q if and only if d（A） ｜ p ＋ q. We apply the result to the matrices in Mn（Z） and Mn（Q[x]） and prove that if R = 7. or Q[x], then any nonzero matrix A in Mn（R） can be written as a sum of two matrices in Mn（R） with prime determinants.
文摘The penalty equation of LCP is transformed into the absolute value equation, and then the existence of solutions for the penalty equation is proved by the regularity of the interval matrix. We propose a generalized Newton method for solving the linear complementarity problem with the regular interval matrix based on the nonlinear penalized equation. Further, we prove that this method is convergent. Numerical experiments are presented to show that the generalized Newton method is effective.
基金This work is supported by the National Natural Science Foundation of China with No.11461046the Natural Science Foundation of Jiangxi Province of China with Nos.20181ACB20001 and 20161ACB21005.
文摘In this paper,by means of constructing the linear complementarity problems into the corresponding absolute value equation,we raise an iteration method,called as the nonlinear lopsided HSS-like modulus-based matrix splitting iteration method,for solving the linear complementarity problems whose coefficient matrix in R^(n×n)is large sparse and positive definite.From the convergence analysis,it is appreciable to see that the proposed method will converge to its accurate solution under appropriate conditions.Numerical examples demonstrate that the presented method precede to other methods in practical implementation.
文摘We study a special class of lower trigonometric matrix value boundary value problems on hyperbolas. Firstly, the pseudo-orthogonal polynomial on hyperbola is given in bilinear form and it is shown that it is the only one. Secondly, a special boundary value problem of lower triangular matrix is presented and transformed into four related boundary value problems. Finally, Liouville theorem and Painlevé theorem and pseudo-orthogonal polynomials are used to give solutions.
文摘The present work deals with the calculation of transition probability between two diabatic potentials coupled by any arbitrary coupling. The method presented in this work is applicable to any type of coupling while for numerical calculations we have assumed the arbitrary coupling as Gaussian coupling. This arbitrary coupling is expressed as a collection of Dirac delta functions and by the use of the transfer matrix technique the transition probability from one diabatic potential to another diabatic potential is calculated. We examine our approach by considering the case of two constant potentials coupled by Gaussian coupling as an arbitrary coupling.
