Results 1  10
of
184
A Bibliography of Publications in the SIAM Journal on Matrix Analysis and Applications
"... Title word crossreference (0, 1) [BH96].( ..."
Submitted for publication in SIAM Journal on Matrix Analysis and ApplicationsRAL Library
, 2012
"... rankdeficient sparse matrices ..."
SUBMITTED TO SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, SEPTEMBER 2004 REDUCING COMPLEXITY IN PARALLEL ALGEBRAIC MULTIGRID PRECONDITIONERS
"... Abstract. Algebraic multigrid (AMG) is a very efficient iterative solver and preconditioner for large unstructured linear systems. Traditional coarsening schemes for AMG can, however, lead to computational complexity growth as problem size increases, resulting in increased memory use and execution t ..."
Abstract
 Add to MetaCart
for various large 3D problems. Key words. AMS subject classifications. 1. Introduction. The Algebraic Multigrid (AMG) algorithm [1, 11, 12, 2] is one of the most efficient algorithms for solving large unstructured sparse linear systems that arise in a wide range of science and engineering applications. One
Multiplerank modifications of a sparse cholesky factorization. SIAM Journal on Matrix Analysis and Applications 22, 4, 997–1013. 16: A gallery of digital paper models. Models were computed with the algorithm described in Section 5 with scans of real pape
"... Abstract. Given a sparse symmetric positive definite matrix AA T and an associated sparse Cholesky factorization LDL T or LL T , we develop sparse techniques for updating the factorization after either adding a collection of columns to A or deleting a collection of columns from A. Our techniques ar ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
are based on an analysis and manipulation of the underlying graph structure, using the framework developed in an earlier paper on rank1 modifications [T. A. Davis and W. W. Hager, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 606627]. Computationally, the multiplerank update has better memory traffic
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. (2010) Published online in Wiley Online Library (wileyonlinelibrary.com). DOI: 10.1002/nla.739
"... We show that any admissible cycleconvergence behavior is possible for restarted GMRES at a number of initial cycles, moreover the spectrum of the coefficient matrix alone does not determine this cycleconvergence. The latter can be viewed as an extension of the result of Greenbaum, Pták and Strakos ..."
Abstract
 Add to MetaCart
and Strakos ̌ (SIAM Journal on Matrix Analysis and Applications 1996; 17(3):465–469) to the case of restarted GMRES.
The scaling and squaring method for the matrix exponential revisited
 SIAM REV
, 2009
"... The calculation of the matrix exponential e A maybeoneofthebestknownmatrix problems in numerical computation. It achieved folk status in our community from the paper by Moler and Van Loan, “Nineteen Dubious Ways to Compute the Exponential of a Matrix, ” published in this journal in 1978 (and revisit ..."
Abstract

Cited by 100 (20 self)
 Add to MetaCart
existing methods in terms of both accuracy and efficiency, but that is what the SIGEST selection in this issue does. “The Scaling and Squaring Method for the Matrix Exponential Revisited ” by N. Higham, originally published in the SIAM Journal on Matrix Analysis and Applications in 2005, applies a new
The Journal of Fourier Analysis and Applications
"... ABSTRACT. Matrix refinement equations are functional equations of the form f(x) = PN k=0 ck f(2x − k), where the coefficients ck are matrices and f is a vectorvalued function. Refinement equations play key roles in wavelet theory and approximation theory. Existence and uniqueness properties of scal ..."
Abstract
 Add to MetaCart
ABSTRACT. Matrix refinement equations are functional equations of the form f(x) = PN k=0 ck f(2x − k), where the coefficients ck are matrices and f is a vectorvalued function. Refinement equations play key roles in wavelet theory and approximation theory. Existence and uniqueness properties
COMPUTING THE ACTION OF THE MATRIX EXPONENTIAL, WITH AN APPLICATION TO EXPONENTIAL INTEGRATORS
, 2010
"... A new algorithm is developed for computing etAB, where A is an n × n matrix and B is n×n0 with n0 ≪ n. The algorithm works for any A, its computational cost is dominated by the formation of products of A with n × n0 matrices, and the only input parameter is a backward error tolerance. The algorithm ..."
Abstract

Cited by 31 (9 self)
 Add to MetaCart
the recent analysis of AlMohy and Higham [SIAM J. Matrix Anal. Appl. 31 (2009), pp. 970989], which provides sharp truncation error bounds expressed in terms of the quantities ‖Ak‖1/k for a few values of k, where the norms are estimated using a matrix norm estimator. Shifting and balancing are used
The Journal of Fourier Analysis and Applications
"... ABSTRACT. Compactly supported distributions f1,..., fr on Rd are refinable if each fi is a finite linear combination of the rescaled and translated distributions fj(Ax−k), where the translates k are taken along a lattice Γ ⊂ Rd and A is a dilation matrix that expansively maps Γ into itself. Refinabl ..."
Abstract
 Add to MetaCart
ABSTRACT. Compactly supported distributions f1,..., fr on Rd are refinable if each fi is a finite linear combination of the rescaled and translated distributions fj(Ax−k), where the translates k are taken along a lattice Γ ⊂ Rd and A is a dilation matrix that expansively maps Γ into itself
TO APPEAR IN SIAM JOURNAL ON SCIENTIFIC COMPUTING DISCRETEORDINATE DISCONTINUOUS GALERKIN METHODS FOR SOLVING THE RADIATIVE TRANSFER EQUATION
"... Abstract. The radiative transfer equation (RTE) occurs in a wide variety of applications. In this paper, we study discreteordinate discontinuous Galerkin methods for solving the RTE. The numerical methods are formed in two steps. In the first step, the discrete ordinate technique is applied to disc ..."
Abstract
 Add to MetaCart
Abstract. The radiative transfer equation (RTE) occurs in a wide variety of applications. In this paper, we study discreteordinate discontinuous Galerkin methods for solving the RTE. The numerical methods are formed in two steps. In the first step, the discrete ordinate technique is applied
Results 1  10
of
184