Yale sparse matrix package I: The symmetric codes
From MaRDI portal
Cited in
(51)- Real valued iterative methods for solving complex symmetric linear systems
- Stiff ODE solvers: A review of current and coming attractions
- A survey of direct methods for sparse linear systems
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- Parallel profiling of water distribution networks using the Clément formula
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Minimal energy surfaces using parametric splines
- Developing software for time-dependent problems using the method of lines and differential-algebraic integrators
- A Marching Technique for Nonseparable Equations
- An adaptive, multi-level method for elliptic boundary value problems
- A high performance level-block approximate LU factorization preconditioner algorithm
- The BPMPD interior point solver for convex quadratic problems
- The effect of partial pivoting in sparse ordinary differential equation solvers
- Accuracy and efficiency of time integration methods for 1D diffusive wave equation
- A two level solver for \(h{-}p\) adaptive finite element equations
- The effect of ordering on preconditioned conjugate gradients
- On the control of noise in finite element tidal computations: A semi- implicit approach
- An implementation of Karmarkar's algorithm for linear programming
- Implementing cholesky factorization for interior point methods of linear programming
- Parallel homotopy algorithm for symmetric large sparse eigenproblems
- A new finite difference algorithm for computing the boundary layer flow of viscoelastic fluids in hydromagnetics.
- Pressure flux-split viscous solutions for swirl diffusers
- YSMP
- A parallel multithreaded sparse triangular linear system solver
- Different scenarios in a controlled tubular reactor with a countercurrent coolant
- Fully coupled solution of the equations for incompressible recirculating flows using a penalty-function finite-difference formulation
- Interior dual proximal point algorithm using preconditioned conjugate gradient †
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- A block preconditioned conjugate gradient-type iterative solver for linear systems in thermal reservoir simulation
- Solution of sparse positive definite systems on a shared-memory multiprocessor
- Interior dual proximal point algorithm for linear programs
- Interior proximal point algorithm for linear programs
- Numerical computation of invariant circles of maps
- A fast Poisson solver
- NONCONFORMING FINITE ELEMENT METHODS FOR THE THREE-DIMENSIONAL HELMHOLTZ EQUATION: ITERATIVE DOMAIN DECOMPOSITION OR GLOBAL SOLUTION?
- An MEBDF package for the numerical solution of large sparse systems of stiff initial value problems
- KINSOLVER: A simulator for computing large ensembles of biochemical and gene regulatory networks
- Composite overlapping meshes for the solution of partial differential equations
- Performance analysis of 13 methods to solve the Galerkin method equations
- A fast iterative method to compute the flow around a submerged body
- A comparison of particle-in-cell and Fokker-Planck methods as applied to the modeling of auxiliary-heated mirror plasmas
- Solution of sparse positive definite systems on a hypercube
- A mathematical model and numerical method for studying platelet adhesion and aggregation during blood clotting
- The importance of structure in incomplete factorization preconditioners
- Alternating direction along flow lines in a fluid flow problem
- Difference schemes for the parabolic wave equation in ocean acoustics
- An efficient method for solving stiff transient field problems arising from FEM formulations
- Sparse matrix multiplication package (SMMP)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- The use of adaptive grid refinement for badly behaved elliptic partial differential equations
This page was built for publication: Yale sparse matrix package I: The symmetric codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3954728)
