symrcm
From MaRDI portal
Software:20575
swMATH8566MaRDI QIDQ20575FDOQ20575
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- A dynamic finite element preanalyser
- An \(O(N)\) parallel method of computing the log-Jacobian of the variable transformation for models with spatial interaction on a lattice
- Finite Element Methods for Nonlinearly Viscous Fluids
- Sparse matrix element topology with application to AMG(e) and preconditioning
- An Improvement to Exact Reanalysis Algorithm for Local Non-topological Structural Modifications
- Stress-based finite element analysis of plane plasticity problems
- Efficient mesh management in firedrake using PETSc DMPlex
- Stable, high-order discretization for evolution of the wave equation in \(2+1\) dimensions
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- A parallel linear solver exploiting the physical properties of the underlying mechanical problem
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- Superconsistent collocation methods with applications to convection-dominated convection-diffusion equations
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- Band Generalization of the Golub--Kahan Bidiagonalization, Generalized Jacobi Matrices, and the Core Problem
- Preconditioned biconjugate gradient methods for numerical reservoir simulation
- A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
- Preconditioning of the \(p\)-version of the finite element method
- The preconditioned conjugate gradient method with incomplete factorization preconditioners
- LU decompositions of generalized diagonally dominant matrices
- The versatility of automatic mesh generators based on tree structures and advanced geometric constructs
- Application of the dual active set algorithm to quadratic network optimization
- Investigation of the structure of binary variables
- Vector processing in simplex and interior methods for linear programming
- Parallel sparse Gaussian elimination with partial pivoting
- Modified block-approximate factorization strategies
- A comparison of projective and direct solvers for finite elements in elastostatics
- A Spatial Model for the Needle Losses of Pine-Trees in the Forests of Baden-Württemberg: An Application of Bayesian Structured Additive Regression
- Algorithms for the reduction of matrix bandwidth and profile
- Quotient tree partitioning of undirected graphs
- Finite element network approximation of conductivity in particle composites
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Solution algorithms for nonlinear transient heat conduction analysis employing element-by-element iterative strategies
- Solution of sparse positive definite systems on a shared-memory multiprocessor
- Fast Stokesian dynamics
- Conditioning analysis of positive definite matrices by approximate factorizations
- Conditioning analysis of sparse block approximate factorizations
- Analytical bounds for block approximate factorization methods
- Incomplete factorizations of singular linear systems
- Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems
- Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
- Solution of sparse linear least squares problems using Givens rotations
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Unstructured meshing for two asset barrier options
- Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems
- Task scheduling for parallel sparse Cholesky factorization
- Computational methods in linear algebra
- Direct, partitioned and projected solution to finite element consolidation models
- Solution of sparse positive definite systems on a hypercube
- A physical interpretation of factorization and factor modification in structural analysis
- Finding pseudoperipheral nodes in graphs
- Separators and structure prediction in sparse orthogonal factorization
- A parallel multi-\(p\) method
- Towards a cost-effective ILU preconditioner with high level fill
- Bivariate least squares approximation with linear constraints
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
- Some aspects of parallel implementation of the finite-element method on message passing architectures
- Performance contest between MLE and GMM for huge spatial autoregressive models
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Calculs de complexité relatifs à une méthode de dissection emboîtée
- An efficient simplex type algorithm for sparse and dense linear programs.
- A survey of direct methods for sparse linear systems
- Smooth interpolation to scattered data by bivariate piecewise polynomials of odd degree
- On sparse matrix orderings in interior point methods
- Bandwidth on AT-free graphs
- Title not available (Why is that?)
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- Numerical linear algebra algorithms and software
- On the ordering of sparse linear systems
- Refining an approximate inverse
- Bandwidth of bipartite permutation graphs in polynomial time
- The hierarchical basis multigrid method for convection-diffusion equations
- SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER
- Equivalence between lowest-order mixed finite element and multi-point finite volume methods on simplicial meshes
- Iterative methods for overflow queueing models. I
- Factoring matrices with a tree-structured sparsity pattern
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- Heuristics for matrix bandwidth reduction
- Fast linear equation solvers in high performance electromagnetic field analysis
- Symbiosis between linear algebra and optimization
- Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs
- Linear and non‐linear iterative methods for the incompressible Navier‐Stokes equations
- Numerical homogenization: survey, new results, and perspectives
- An algorithm for solving singular perturbation problems with mechanization
- Using domain decomposition to find graph bisectors
- A sparse matrix approach to Bayesian computation in large linear models
- Efficient unsteady high Reynolds number flow computations on unstructured grids
- On the performance of the algebraic optimized Schwarz methods with applications
- Viscous computations using a direct solver
- Scattered data interpolation based upon generalized minimum norm networks
- Symmetric indefinite systems for interior point methods
- A practical algorithm for making filled graphs minimal
- Parallel solution techniques in computational structural mechanics
- Improving Jacobi and Gauss-Seidel iterations
- Applications of statistical condition estimation to the solution of linear systems
- Multisplittings and parallel iterative methods
- Convergence of a direct-iterative method for large-scale least-squares problems
- Derivative generation from multivariate scattered data by functional minimization
- A direct method for sparse least squares problems with lower and upper bounds
- A chordal preconditioner for large-scale optimization
- Algorithms of parallel computations for linear algebra problems with irregularly structured matrices
This page was built for software: symrcm