An Accelerated Bisection Method for the Calculation of Eigenvalues of a Symmetric Tridiagonal Matrix.
An adaptive -step conjugate gradient algorithm with dynamic basis updating
The adaptive -step CG algorithm is a solver for sparse symmetric positive definite linear systems designed to reduce the synchronization cost per iteration while still achieving a user-specified accuracy requirement. In this work, we improve the adaptive -step conjugate gradient algorithm by the use of iteratively updated estimates of the largest and smallest Ritz values, which give approximations of the largest and smallest eigenvalues of , using a technique due to G. Meurant and P. Tichý (2018)....
An additive Schwarz method for mortar Morley finite element discretizations of 4th order elliptic problem in 2D.
An aggregation-based algebraic multigrid method.
An algebraic construction of discrete wavelet transforms
Discrete wavelets are viewed as linear algebraic transforms given by banded orthogonal matrices which can be built up from small matrix blocks satisfying certain conditions. A generalization of the finite support Daubechies wavelets is discussed and some special cases promising more rapid signal reduction are derived.
An Algorithm for Best Approximate Solutions of Ax = b with a Smooth Strictly Convex Norm.
An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric.
An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.
An algorithm for solving the absolute value equation.
An algorithm for the inversion of partitioned matrices
An algorithm that carries a square matrix into its transpose by an involutory congruence transformation.
An Algorithm to Compute a Sparse Basis of the Null Space.
An alternating direction implicit method for orthogonal spline collocation linear systems.
An alternating-direction iteration method for Helmholtz problems
An alternating-direction iterative procedure is described for a class of Helmholz-like problems. An algorithm for the selection of the iteration parameters is derived; the parameters are complex with some having positive real part and some negative, reflecting the noncoercivity and nonsymmetry of the finite element or finite difference matrix. Examples are presented, with an applications to wave propagation.
An Alternative Givens Ordering.
An analysis of low-rank modifications of preconditioners for saddle point systems.
An analysis of the composite step biconjugate gradient method.
An analysis of the pole placement problem I: The single-input case.
An analysis of the pole placement problem. II: The multi-input case.
An Analysis of the Shifted LR Algorithm.