A center of a polytope: An expository review and a parallel implementation.
A comparison of three algorithms for reducing the profile of a sparse matrix
A Constructive Method of Solving the Liapounov Equation for Complex Matrices.
A Continuous Selection of the Metric Projection in Matrix Spaces, Addendum.
A Fully Stable Rational Version of the QR Algorithm for Tridiagonal Matrices.
A hybrid method for nonlinear least squares that uses quasi-Newton updates applied to an approximation of the Jacobian matrix
In this contribution, we propose a new hybrid method for minimization of nonlinear least squares. This method is based on quasi-Newton updates, applied to an approximation of the Jacobian matrix , such that . This property allows us to solve a linear least squares problem, minimizing instead of solving the normal equation , where is the required direction vector. Computational experiments confirm the efficiency of the new method.
A least-squares method for the numerical solution of the Dirichlet problem for the elliptic monge − ampère equation in dimension two
We address in this article the computation of the convex solutions of the Dirichlet problem for the real elliptic Monge − Ampère equation for general convex domains in two dimensions. The method we discuss combines a least-squares formulation with a relaxation method. This approach leads to a sequence of Poisson − Dirichlet problems and another sequence of low dimensional algebraic eigenvalue problems of a new type. Mixed finite element approximations with a smoothing procedure are used for the...
A method for the inverse numerical range problem.
A multishift algorithm for the numerical solution of algebraic Riccati equations.
A note on algorithms for determining the copositivity of a given symmetric matrix.
A note on linear approximations of matrices
A note on symplectic block reflectors.
A one parameter method for the matrix inverse square root
This paper is motivated by the paper [3], where an iterative method for the computation of a matrix inverse square root was considered. We suggest a generalization of the method in [3]. We give some sufficient conditions for the convergence of this method, and its numerical stabillity property is investigated. Numerical examples showing that sometimes our generalization converges faster than the methods in [3] are presented.
A polynomial time spectra decomposition test for certain classes of inverse M-matrices.
A propos de l’algorithme
A quadratically convergent Bernoulli-like algorithm for solving matrix polynomial equations in Markov chains.
A Quadratically Convergent Jacobi-Like Method for Real Matrices With Complex Eigenvalues.
A rational canonical form algorithm
We present an easy-to-implement algorithm for transforming a matrix to rational canonical form.
A resultant approach to computing vector characteristics of multiparameter polynomial matrices.
A solution of the continuous Lyapunov equation by means of power series