Convergence of infinite products of matrices and inner-outer iteration schemes.
Convergence of -norms of a matrix
a recurrence relation for computing the -norms of an Hermitian matrix is derived and an expression giving approximately the number of eigenvalues which in absolute value are equal to the spectral radius is determined. Using the -norms for the approximation of the spectral radius of an Hermitian matrix an a priori and a posteriori bounds for the error are obtained. Some properties of the a posteriori bound are discussed.
Convergence of Linear Multistep Methods for Differential Equations with Discontinuities.
Convergence of locally divergence-free discontinuous-Galerkin methods for the induction equations of the 2D-MHD system
We present the convergence analysis of locally divergence-free discontinuous Galerkin methods for the induction equations which appear in the ideal magnetohydrodynamic system. When we use a second order Runge Kutta time discretization, under the CFL condition , we obtain error estimates in of order where is the degree of the local polynomials.
Convergence of locally divergence-free discontinuous-Galerkin methods for the induction equations of the 2D-MHD system
We present the convergence analysis of locally divergence-free discontinuous Galerkin methods for the induction equations which appear in the ideal magnetohydrodynamic system. When we use a second order Runge Kutta time discretization, under the CFL condition , we obtain error estimates in L2 of order where m is the degree of the local polynomials.
Convergence of mass redistribution method for the one-dimensional wave equation with a unilateral constraint at the boundary
This paper focuses on a one-dimensional wave equation being subjected to a unilateral boundary condition. Under appropriate regularity assumptions on the initial data, a new proof of existence and uniqueness results is proposed. The mass redistribution method, which is based on a redistribution of the body mass such that there is no inertia at the contact node, is introduced and its convergence is proved. Finally, some numerical experiments are reported.
Convergence of multistep methods for systems of ordinary differential equations with parameters
The author considers the convergence of quasilinear nonstationary multistep methods for systems of ordinary differential with parameters. Sufficient conditions for their convergence are given. The new numerical method is tested for two examples and it turns out to be a little better than the Hamming method.
Convergence of Multistep Methods for Volterra Functional Differential Equations.
Convergence of multistep methods for Volterra integro-differential equations
Convergence of nested classical iterative methods for linear systems.
Convergence of Newton-like methods for singular operator equations using outer inverses.
Convergence of Newton-Like Methods for Solving Systems of Nonlinear Equations.
Convergence of Newton-Like-Iterative Methods.
Convergence of numerical algorithms for semilinear hyperbolic system
Convergence of numerical methods and parameter dependence of min-plus eigenvalue problems, Frenkel-Kontorova models and homogenization of Hamilton-Jacobi equations
Using the min-plus version of the spectral radius formula, one proves: 1) that the unique eigenvalue of a min-plus eigenvalue problem depends continuously on parameters involved in the kernel defining the problem; 2) that the numerical method introduced by Chou and Griffiths to compute this eigenvalue converges. A toolbox recently developed at I.n.r.i.a. helps to illustrate these results. Frenkel-Kontorova models serve as example. The analogy with homogenization of Hamilton-Jacobi equations is emphasized....
Convergence of numerical methods and parameter dependence of min-plus eigenvalue problems, Frenkel-Kontorova models and homogenization of Hamilton-Jacobi equations
Using the min-plus version of the spectral radius formula, one proves: 1) that the unique eigenvalue of a min-plus eigenvalue problem depends continuously on parameters involved in the kernel defining the problem; 2) that the numerical method introduced by Chou and Griffiths to compute this eigenvalue converges. A toolbox recently developed at I.n.r.i.a. helps to illustrate these results. Frenkel-Kontorova models serve as example. The analogy with homogenization of Hamilton-Jacobi equations...
Convergence of numerical methods for systems of neutral functional-differential-algebraic equations
A general class of numerical methods for solving initial value problems for neutral functional-differential-algebraic systems is considered. Necessary and sufficient conditions under which these methods are consistent with the problem are established. The order of consistency is discussed. A convergence theorem for a general class of methods is proved.
Convergence of primal-dual solutions for the nonconvex log-barrier method without LICQ
This paper characterizes completely the behavior of the logarithmic barrier method under a standard second order condition, strict (multivalued) complementarity and MFCQ at a local minimizer. We present direct proofs, based on certain key estimates and few well–known facts on linear and parametric programming, in order to verify existence and Lipschitzian convergence of local primal-dual solutions without applying additionally technical tools arising from Newton–techniques.
Convergence of Rothe's method in Hölder spaces
The convergence of Rothe’s method in Hölder spaces is discussed. The obtained results are based on uniform boundedness of Rothe’s approximate solutions in Hölder spaces recently achieved by the first author. The convergence and its rate are derived inside a parabolic cylinder assuming an additional compatibility conditions.
Convergence of Rump's method for computing the Moore-Penrose inverse
We extend Rump's verified method (S. Oishi, K. Tanabe, T. Ogita, S. M. Rump (2007)) for computing the inverse of extremely ill-conditioned square matrices to computing the Moore-Penrose inverse of extremely ill-conditioned rectangular matrices with full column (row) rank. We establish the convergence of our numerical verified method for computing the Moore-Penrose inverse. We also discuss the rank-deficient case and test some ill-conditioned examples. We provide our Matlab codes for computing the...