scientific article; zbMATH DE number 194668

A. M. Erisman, John K. Reid, Iain S. Duff

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithms ordering partitioning textbook sparse matrices direct methods problems pivoting test matrices FORTRAN storing tearing methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items

Optimal Dirichlet control of partial differential equations on networks, Matrix-equation-based strategies for convection-diffusion equations, An accelerated Poisson solver based on multidomain spectral discretization, Domain decomposition in time for PDE-constrained optimization, Fast solvers for optimal control problems from pattern formation, ILUS: An incomplete LU preconditioner in sparse skyline format, Estimating spatial covariance using penalised likelihood with weightedL₁penalty, Minimum deviation, quasi-LU factorization of nonsingular matrices, Performance optimizations for scalable implicit RANS calculations with SU2, Fast Cholesky factorization for interior point methods of linear programming, SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER, Improving the numerical stability and the performance of a parallel sparse solver, A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices, Potential reduction algorithms for structured combinatorial optimization problems, The implementation of a generalized cross validation algorithm using deflation techniques for linear systems, An improved numerical method for balanced truncation for symmetric second-order systems, Dynamics of viscoelastic liquid filaments: low capillary number flows, Beads-on-string formation during filament pinch-off: dynamics with the PTT model for non-affine motion, A polynomial arc-search interior-point algorithm for linear programming, Fitting very large sparse Gaussian graphical models, Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization, Most secant varieties of tangential varieties to Veronese varieties are nondefective, CVXGEN: a code generator for embedded convex optimization, A direct solver for variable coefficient elliptic PDEs discretized via a composite spectral collocation method, An $O(N)$ algorithm for constructing the solution operator to 2D elliptic boundary value problems in the absence of body loads, Efficient handling of complex shift parameters in the low-rank Cholesky factor ADI method, Block-tridiagonal state-space realization of chemical master equations: a tool to compute explicit solutions, Approximate factoring of the inverse, Rational approximation to the Fermi-Dirac function with applications in density functional theory, Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition, Interior point methods 25 years later, An Adaptive High Order Direct Solution Technique for Elliptic Boundary Value Problems, Computing symmetric nonnegative rank factorizations, $Booster$: A high-level language for portable parallel algorithms, New parallel sparse direct solvers for multicore architectures, Two-level mortar domain decomposition preconditioners for heterogeneous elliptic problems, A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides, Combined error estimates for local fluctuations of SPDEs, Partitioning strategies for the block Cimmino algorithm, Implementing cholesky factorization for interior point methods of linear programming, A parallel shared-memory implementation of a high-order accurate solution technique for variable coefficient Helmholtz problems, Compressing Rank-Structured Matrices via Randomized Sampling, OSQP: An Operator Splitting Solver for Quadratic Programs, Parallel direct Poisson solver for discretisations with one Fourier diagonalisable direction, Splitting dense columns of constraint matrix in interior point methods for large scale linear programming¹¹The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:²²A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…, Quadrature rule-based bounds for functions of adjacency matrices, A field-based finite element method for magnetostatics derived from an error minimization approach, Motivations and realizations of Krylov subspace methods for large sparse linear systems, An $O(N)$ direct solver for integral equations on the plane, A direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators, Decoupling joint and elastic accelerations in deformable mechanical systems using non-linear recursive formulations, Runge-Kutta based procedure for the optimal control of differential-algebraic equations, Confinement effects in dip coating, Multiple centrality corrections in a primal-dual method for linear programming, A Sparse Symmetric Indefinite Direct Solver for GPU Architectures, Sparse Gaussian Elimination Modulo p: An Update, Price-directive decomposition applied to routing in telecommunication networks, The augmented system variant of IPMs in two-stage stochastic linear programming computation, Practical quasi-Newton methods for solving nonlinear systems, On the use of dense matrix techniques within sparse simplex, On parallelism and convergence of incomplete LU factorizations, A contribution of sparse matrices tools to matrix population model analysis, Parallel interior-point method for linear and quadratic programs with special structure, Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case