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

84 921 (0,178s)

Result

Semi-sparse Cholesky Factorization

The Cholesky factorization (shortly CHF) is one of basic methods to solve. The process of Cholesky factorization of the originally sparse matrix A leads number of fills, special process called symbolic factoriz...

IN - Informatika

  • 2005
  • A
Result

Algebraic description of the finite Stieltjes moment problem

authors. Since the description uses matrices of moments, it is not intendedThe Stieltjes problem of moments seeks for a nondecreasing positive distribution function mu(lambda) on the semi-axis [0, +infinity) so that its

Applied mathematics

  • 2019
  • Jimp
  • Link
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 positive sem...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
Result

Cholesky-like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms

indefinite matrix $A$ can be eventually seen as its factorization $B=QR$ that is equivalent to theCholesky-like factorization in the form $B^TAB=R^T Omega R$, where $R of the triangular factor $R$ in terms of extremal sing...

BA - Obecná matematika

  • 2015
  • Jx
  • Link
Result

Cholesky decomposition of a positive semidefinite matrix with known kernel

The Cholesky decomposition of a symmetric positive semidefinite matrix A is a useful tool for solving the related consistent system of linear equations and sparse. To use the Cholesky decomposition effectively, it is necessary to id...

BA - Obecná matematika

  • 2011
  • Jx
  • 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 symmetric indefinite systems...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
Result

A Robust Incomplete Factorization Preconditioner for Positive Definite Matrices.

We describe a novel technique for computing a sparse incomplete factorization of a general symmetric positive definite matrix A. The factorization is not based on the Cholesky algorithm 9or Gaussian elimination0, but on A-o...

BA - Obecná matematika

  • 2003
  • Jx
Result

Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure

The direct methods for the solution of systems of linear equations with a symmetric positive semidefinite matrix A usually comprise the Cholesky decomposition, paying special attention to the stiffness matrices of floating structure...

BA - Obecná matematika

  • 2011
  • Jx
  • Link
Result

Node Renumbering Strategies for Efficient Direct Methods in Selected Problems of Soil Mechanics

on the PETSc Cholesky solver performance. The sparse matrices chosen for numerical testing and the best QMD reordering was able to reduce the factorization time by factor up to 1000, the solve by factor u...

Applied mathematics

  • 2023
  • D
  • Link
Result

Analysis of fixing nodes used in generalized inverse computation

in the solution of contact problems. Systems with semidefinite matrices can be solved by standarddirect methods for the solution of systems with positive definite matrices adapted is a modification of Cholesky decompositio...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
  • 1 - 10 out of 84 921