The following pages link to symrcm (Q20575):
Displaying 50 items.
- An Explicit Link between Gaussian Fields and Gaussian Markov Random Fields: The Stochastic Partial Differential Equation Approach (Q68580) (← links)
- A sparse linear algebra algorithm for fast computation of prediction variances with Gaussian Markov random fields (Q148999) (← links)
- A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems (Q268866) (← links)
- Matrix-equation-based strategies for convection-diffusion equations (Q291921) (← links)
- A two-level ILU preconditioner for electromagnetic applications (Q313630) (← links)
- A banded preconditioner for the two-sided, nonlinear space-fractional diffusion equation (Q316084) (← links)
- Numerical treatment of wave breaking on unstructured finite volume approximations for extended Boussinesq-type equations (Q349274) (← links)
- Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices (Q357310) (← links)
- Discontinuous control-volume/finite-element method for advection-diffusion problems (Q365597) (← links)
- The dynamic behaviour of elastic coaxial cylindrical shells conveying fluid (Q370546) (← links)
- High performance verified computing using C-XSC (Q382427) (← links)
- On sparse matrix orderings in interior point methods (Q402236) (← links)
- Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs (Q429474) (← links)
- Efficient unsteady high Reynolds number flow computations on unstructured grids (Q435525) (← links)
- Algorithms of parallel computations for linear algebra problems with irregularly structured matrices (Q464994) (← links)
- Stability analysis of cylindrical shells containing a fluid with axial and circumferential velocity components (Q468969) (← links)
- On the performance of the algebraic optimized Schwarz methods with applications (Q478203) (← links)
- Effective preconditioning through minimum degree ordering interleaved with incomplete factorization (Q482688) (← links)
- Inverse-free recursive multiresolution algorithms for a data approximation problem (Q521277) (← links)
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming (Q522098) (← links)
- Factoring matrices with a tree-structured sparsity pattern (Q551257) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- Viscous computations using a direct solver (Q583992) (← links)
- Efficient solution for Galerkin-based polynomial chaos expansion systems (Q614007) (← links)
- Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems (Q615044) (← links)
- Cholesky decomposition of a positive semidefinite matrix with known kernel (Q632820) (← links)
- Sparse direct factorizations through unassembled hyper-matrices (Q649249) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Dynamics of a large scale rigid-flexible multibody system composed of composite laminated plates (Q655953) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- The decomposition of a communication network considering traffic demand interrelations (Q679227) (← links)
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
- Hemelb: A high performance parallel lattice-Boltzmann code for large scale fluid flow in complex geometries (Q710225) (← links)
- How ordinary elimination became Gaussian elimination (Q716156) (← links)
- A parallel linear solver exploiting the physical properties of the underlying mechanical problem (Q723144) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- Investigation of the structure of binary variables (Q750057) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- Parallel sparse Gaussian elimination with partial pivoting (Q753685) (← links)
- Modified block-approximate factorization strategies (Q758105) (← links)
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model (Q761765) (← links)
- Computational methods in linear algebra (Q788456) (← links)
- A physical interpretation of factorization and factor modification in structural analysis (Q790661) (← links)
- Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
- Finding pseudoperipheral nodes in graphs (Q797999) (← links)
- An algorithm to compute a sparse basis of the null space (Q799342) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (Q803714) (← links)
- The dual variable method for solving fluid flow difference equations on Delaunay triangulations (Q806478) (← links)
- Estimating the matrix \(p\)-norm (Q811644) (← links)
