Results 11 to 20 of about 213 (32)
The limit empirical spectral distribution of Gaussian monic complex matrix polynomials
, 2020 We define the empirical spectral distribution (ESD) of a random matrix polynomial with invertible leading coefficient, and we study it for complex $n \times n$ Gaussian monic matrix polynomials of degree $k$.
Barbarino, Giovanni, Noferini, Vanni
core +1 more source
An efficient LDU algorithm for the minimal least squares solution of linear systems [PDF]
, 2018 The minimal least squares solutions is a topic of interest due to the broad range of applications of this problem. Although it can be obtained from other algorithms, such as the Singular Value Decomposition (SVD) or the Complete Orthogonal Decomposition (
Abasolo Bilbao, Mikel +3 more
core +2 more sources
On a general extending and constraining procedure for linear iterative methods [PDF]
, 2009 Algebraic Reconstruction Techniques (ART), on their both successive or simultaneous formulation, have been developed since early 70's as efficient ''row action methods'' for solving the image reconstruction problem in Computerized Tomography.
Nicola, Auralian +3 more
core +1 more source
Family Constraining of Iterative Algorithms
, 2013 In constraining iterative processes, the algorithmic operator of the iterative process is pre-multiplied by a constraining operator at each iterative step.
Censor, Yair +2 more
core +1 more source
Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations [PDF]
, 2016 The efficient solution of the normal equations corresponding to a large sparse linear least squares problem can be extremely challenging. Robust incomplete factorization (RIF) preconditioners represent one approach that has the important feature of ...
Scott, Jennifer, Tuma, Miroslav
core +1 more source
LSMR: An iterative algorithm for sparse least-squares problems
, 2011 An iterative method LSMR is presented for solving linear systems $Ax=b$ and least-squares problem $\min \norm{Ax-b}_2$, with $A$ being sparse or a fast linear operator. LSMR is based on the Golub-Kahan bidiagonalization process.
Ayrancı +35 more
core +1 more source
, 2009 A method is developed for estimating the emission rates of contaminants into the atmosphere from multiple point sources using measurements of particulate material deposited at ground level.
Lushi, Enkeleida, Stockie, John M.
core +1 more source
Stationary distributions and mean first passage times of perturbed Markov chains [PDF]
, 2002 Stationary distributions of perturbed finite irreducible discrete time Markov chains are intimately connected with the behaviour of associated mean first passage times.
Hunter, Jeffrey J.
core
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
, 2011 CG, SYMMLQ, and MINRES are Krylov subspace methods for solving symmetric systems of linear equations. When these methods are applied to an incompatible system (that is, a singular symmetric least-squares problem), CG could break down and SYMMLQ's ...
Christopher C. Paige +4 more
core +3 more sources
Navier-Stokes equations as a differential-algebraic system [PDF]
, 1998 Nonsteady Navier-Stokes equations represent a differential-algebraic system of strangeness index one after any spatial discretization. Since such systems are hard to treat in their original form, most approaches use some kind of index ...
Weickert, J.
core +1 more source