All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

218 824 (0,25s)

Result

Improving the Stability and Robustness of Incomplete Symmetric Indefinite Factorization Preconditioners

Sparse symmetric indefinite linear systems of equations arise in numerous practical applications. In many situations, an iterative method is the method of choice but a preconditioner is normally required for it to ...

Applied mathematics

  • 2017
  • Jimp
  • Link
Result

Algorithm for Elimination of Systems with Sparse Asymmetric Reducible Matrices.

In the paper, an algorithm for finding an optimal or almost optimal permutation for an ordering of elements of a matrix, which is sparse, asymmetric and reducible, is suggested. Using this algorithm we can solve large sparse sys...

BA - Obecná matematika

  • 2012
  • Jx
Result

The Linear Direct Sparse Solver on GPU for Bundle Adjustment Method

Implementation of a direct solver for the symmetric positive definite sparse matrix of general structure exploiting the parallelism on the graphic card (GPU). Implementation of a direct solver usining the Schur complement specially ...

JC - Počítačový hardware a software

  • 2011
  • R
  • Link
Result

On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems

Limited-memory incomplete Cholesky factorizations can provide robust preconditioners for sparse symmetric positive-definite linear systems. In this paper, the focus is on extending the approach to sparse <...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
Result

PARALLEL APPROACH TO SOLVE OF THE DIRECT SOLUTION OF LARGE SPARSE SYSTEMS OF LINEAR EQUATIONS

The paper deals with parallel approach for the numerical solution of large, sparse, non-symmetric systems of linear equations, that can be part of any finite element software. In this contribution, the differences ...

Civil engineering

  • 2017
  • D
Result

Sparse direct solution of large finite element problems

This work is focused on methods and algorithms tailored to the direct solution of large sparse symmetric positive-definite linear systems arising from the application of the finite element method in solid continuum...

JJ - Ostatní materiály

  • 2012
  • D
Result

Balanced Incomplete Factorization

The paper deals with the new algorithm to precondition large, sparse, symmetric and positive definite linear systems. The strategy is based on computing both direct and inverse decomposition of the system ...

IN - Informatika

  • 2008
  • Jx
Result

On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization

Incomplete Cholesky factorizations have long been important as preconditioners for use in solving large-scale symmetric positive-definite linear systems. In this paper, we focus on the relationship between two important pos...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
Result

Evaluation of Different Approaches to Solution of the Direct Solution of Large, Sparse Systems of Linear Equations

to solution of large, sparse, non-symmetric systems of linearequations on high performance purpose library for the directsolution of large, sparse, nonsymmetric systems based on direct or iterativealgorit...

JM - Inženýrské stavitelství

  • 2016
  • D
  • Link
Result

Use of Biconjugate Gradients Method to Solve Complex Systems

The article analyses the biconjugate gradients method for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. A special emphasis is laid on symmetric matrices arising from ...

BA - Obecná matematika

  • 2009
  • D
  • 1 - 10 out of 218 824