This paper describes a computational method for improving the accuracy of a given singular value and its associated left and right singular vectors. The method is analogous to iterative improvement for the solution of linear systems. That is, by means of a low-precision computation, an iterative algorithm is applied to increase the accuracy of the singular value and vectors; extended precision computations are used in the residual calculation. The method is related to Newton's Method applied to the singular value problem and inverse iteration for the eigenvalue problem
We propose a general algorithm for solving a $n\times n$ nonsingular linear system $Ax = b$ based on...
We discuss a new method for the iterative computation of a portion of the singular values and vector...
International audienceThe problem considered in this talk is to solve and mainly to refine an approx...
This paper describes a computational method for improving the accuracy of a given eigenvalue and its...
We analyze when it is possible to compute the singular values and singular vectors of a matrix with ...
We examine the behavior of Newton's method in floating point arithmetic, allowing for extended preci...
AbstractMany problems in science require the computation of only one singular vector or, more genera...
AbstractWe investigate novel iterative refinement methods for solving eigenvalue problems which are ...
AbstractInfluenced by some techniques used for computing singular points of nonlinear equations, a g...
AbstractConsider the linear system of equations Bx=ƒ, where B is an NxN singular matrix. In an earli...
A novel method for approximating structured singular values (also known as $\mu$- values) is propose...
We discuss a new method for the iterative computation of a portion of the singular values and vector...
AbstractA method to generate accurate approximations to the singular solutions of a system of (compl...
We present the design and testing of an algorithm for iterative refinement of the solution of linear...
After a general discussion of matrix norms and digital operations, matrix inversion procedures based...
We propose a general algorithm for solving a $n\times n$ nonsingular linear system $Ax = b$ based on...
We discuss a new method for the iterative computation of a portion of the singular values and vector...
International audienceThe problem considered in this talk is to solve and mainly to refine an approx...
This paper describes a computational method for improving the accuracy of a given eigenvalue and its...
We analyze when it is possible to compute the singular values and singular vectors of a matrix with ...
We examine the behavior of Newton's method in floating point arithmetic, allowing for extended preci...
AbstractMany problems in science require the computation of only one singular vector or, more genera...
AbstractWe investigate novel iterative refinement methods for solving eigenvalue problems which are ...
AbstractInfluenced by some techniques used for computing singular points of nonlinear equations, a g...
AbstractConsider the linear system of equations Bx=ƒ, where B is an NxN singular matrix. In an earli...
A novel method for approximating structured singular values (also known as $\mu$- values) is propose...
We discuss a new method for the iterative computation of a portion of the singular values and vector...
AbstractA method to generate accurate approximations to the singular solutions of a system of (compl...
We present the design and testing of an algorithm for iterative refinement of the solution of linear...
After a general discussion of matrix norms and digital operations, matrix inversion procedures based...
We propose a general algorithm for solving a $n\times n$ nonsingular linear system $Ax = b$ based on...
We discuss a new method for the iterative computation of a portion of the singular values and vector...
International audienceThe problem considered in this talk is to solve and mainly to refine an approx...
Add to ORKG