Pages that link to "Item:Q4095771"
From MaRDI portal
The following pages link to An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix (Q4095771):
Displaying 50 items.
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control (Q301689) (← links)
- A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs (Q408436) (← links)
- Parallel block tridiagonalization of real symmetric matrices (Q436780) (← links)
- A domain renumbering algorithm for multi-domain boundary face method (Q463508) (← links)
- A constructive bandwidth reduction algorithm -- a variant of GPS algorithm (Q504151) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- New crash procedures for large systems of linear constraints (Q584077) (← links)
- Bandwidth of graphs resulting from the edge clique covering problem (Q668017) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- An efficient finite element solution using a large pre-solved regular element (Q726289) (← links)
- A review on the application of fuzzy transform in data and image compression (Q780186) (← links)
- Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- Numerical solution of an inverse medium scattering problem for Maxwell's equations at fixed frequency (Q1028263) (← links)
- An iterative parallel workload balancing framework for direct condensation of substructures (Q1033466) (← links)
- Optimal block-tridiagonalization of matrices for coherent charge transport (Q1038026) (← links)
- Algorithms for the reduction of matrix bandwidth and profile (Q1066617) (← links)
- The optimization algorithms of network node relabeling for large finite elements program system (Q1091187) (← links)
- Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers (Q1097088) (← links)
- Block SSOR preconditionings for high-order 3D FE systems. II: Incomplete BSSOR preconditionings (Q1176527) (← links)
- A new matrix bandwidth reduction algorithm (Q1306383) (← links)
- Profile minimization problem for matrices and graphs (Q1327828) (← links)
- A non-nested Galerkin multi-grid method for solving linear and nonlinear solid mechanics problems (Q1370755) (← links)
- Two improved algorithms for envelope and wavefront reduction (Q1371664) (← links)
- A parallel solver for the \(hp\)-version of finite element methods (Q1371905) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
- An efficient algorithm for kriging approximation and optimization with large-scale sampling data. (Q1430665) (← links)
- A parallel multi-\(p\) method (Q1569994) (← links)
- Adapting and optimising fluidity for high-fidelity coastal modelling (Q1649846) (← links)
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
- Improvements on non-equilibrium and transport Green function techniques: the next-generation Transiesta (Q1687073) (← links)
- Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots (Q1736232) (← links)
- \(H\)-theorem for continuous- and discrete-time chemical kinetic systems and a system of nucleosynthesis equations (Q1757636) (← links)
- Diakoptics as a general approach in engineering (Q1821502) (← links)
- Preconditioning techniques for large linear systems: A survey (Q1868569) (← links)
- Weighted graph based ordering techniques for preconditioned conjugate gradient methods (Q1893941) (← links)
- A new approach to minimising the frontwidth in finite element calculations (Q1912069) (← links)
- Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction (Q1913169) (← links)
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (Q1993591) (← links)
- Material point method simulations using an approximate full mass matrix inverse (Q2021934) (← links)
- Metaheuristic algorithms for the bandwidth reduction of large-scale matrices (Q2136166) (← links)
- A novel GPU-parallelized meshless method for solving compressible turbulent flows (Q2214446) (← links)
- An improved three-dimensional implicit discrete velocity method on unstructured meshes for all Knudsen number flows (Q2222450) (← links)
- Implicit method for the solution of supersonic and hypersonic 3D flow problems with lower-upper symmetric-Gauss-Seidel preconditioner on multiple graphics processing units (Q2223296) (← links)
- Addressing the envelope reduction of sparse matrices using a genetic programming system (Q2352428) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Particle swarm optimization and hill climbing for the bandwidth minimization problem (Q2383955) (← links)
- A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
- Profile minimization on compositions of graphs (Q2471064) (← links)
