Results 11 to 20 of about 56 (53)
Identification of induction curves
, 2023 Induction curves (induction surfaces, induction sets in general) were recently introduced to provide a visual aid to examine the fractions defining the norm of a matrix, along with the discovery and description of p-eigenvectors.
LÓCSI, Levente
core +1 more source
Solving The Indefinite Least Square Problem By Hyperbolic Qr Factorization [PDF]
, 2003 The indefinite least squares (ILS) problem involves minimizing a certain type of indefinite quadratic form. We develop perturbation theory for the problem and identify a condition number. We describe and analyze a method for solving the ILS problem based
Bojanczyk, Adam +6 more
core +1 more source
Tikhonov Regularization And Total Least Squares
. Discretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to compute stable solutions to these systems it is necessary to apply regularization methods.
Dianne, Gene Golub, Per Christian Hansen
core +2 more sources
Stationary distributions and mean first passage times of perturbed Markov chains
, 1992 Stationary distributions of perturbed finite irreducible discrete time Markov chains are intimately connected with the behaviour of associated mean first passage times. This interconnection is explored through the use of generalized matrix inverses. Some
Jeffrey J. Hunter
core
, 2008 We present componentwise condition numbers for the problems of Moore-Penrose generalized matrix inversion and linear least squares. Also, the condition numbers for these condition numbers are given.
Xu Wei +3 more
core
Quasi-Newton methods for nonlinear least squares focusing on curvatures
, 1999 A new quasi-New ton method for nonlinear least squares problems is proposed. Tno advantages of the method are accomplished by utilizing special geometrical properties in the problem class.
Eriksson, J.,
core
Restoration of Atmospherically Blurred Images by Symmetric Indefinite Conjugate Gradient Techniques
, 1996 We consider an ill-posed deconvolution problem from astronomical imaging with a given noise-contaminated observation, and an approximately known convolution kernel.
Martin Hanke, James G. Nagy
core
A Total Least Squares Method for Toeplitz Systems of Equations
, 1997 A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an efficient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed ...
Julie Kamm, James G. Nagy
core
Solving Linear Inequalities In A Least Squares Sense
, 1994 . In 1980, Han [6] described a finitely terminating algorithm for solving a system Ax b of linear inequalities in a least squares sense. The algorithm uses a singular value decomposition of a submatrix of A on each iteration, making it impractical for ...
R. Bramley, B. Winnicka
core
A preconditioned Krylov subspace method for the solution of least squares problems
, 1994 We present an iterative method of preconditioned Krylov type for the solution of large least squares problems. We prove that the method is robust and investigate its rate of convergence.
Gérard C. Herman +2 more
core