Results 21 to 30 of about 510,427 (158)
A max-plus approach to incomplete Cholesky factorization preconditioners [PDF]
We present a new method for constructing incomplete Cholesky factorization preconditioners for use in solving large sparse symmetric positive-definite linear systems.
Tisseur, Francoise +3 more
core +2 more sources
MODIFIED INCOMPLETE CHOLESKY FACTORIZATION FOR SOLVING ELECTROMAGNETIC SCATTERING PROBLEMS [PDF]
In this paper, we study a class of modified incomplete Cholesky factorization preconditioners LLT with two control parameters including dropping rules. Before computing preconditioners, the modified incomplete Cholesky factorization algorithm allows to decide the sparsity of incomplete factorization preconditioners by two fillin control parameters: (1)
Tingzhu Huang +4 more
openaire +1 more source
Fast Kernel k-means Clustering Using Incomplete Cholesky Factorization
Kernel-based clustering algorithm can identify and capture the non-linear structure in datasets, and thereby it can achieve better performance than linear clustering. However, computing and storing the entire kernel matrix occupy so large memory that it is difficult for kernel-based clustering to deal with large-scale datasets. In this paper, we employ
Li Chen, Shuisheng Zhou, Jiajun Ma
openaire +2 more sources
Cholesky Factorization of Matrices [PDF]
Cholesky factorization is a type of matrix factorization which is used for solving system of linear equations. In this paper, we will study the factorization of real positive definite matrices by using Cholesky factorization.
Khin Myo Aye
core +1 more source
Affinification: A Fine Approximation of Deformations
Abstract We introduce affinification, a novel method for accelerating physics‐based animation of elastic solids. During a time‐dependent simulation, our method automatically partitions the space into affine and elastic regions depending on the deformation.
A. Mercier‐Aubin +3 more
wiley +1 more source
Accelerating Volkov's Hybrid Implementation of Cholesky Factorization on a Fermi GPU [PDF]
In linear algebra, Cholesky factorization is useful in solving a system of equations with a symmetric positive definite coefficient matrix. Cholesky factorization is roughly twice as fast relative to LU factorization which applies to general matrices. In
Wei, Shih-chieh; Huang, Bormin +3 more
core +1 more source
South Africa's Inflation: Monetary or Fiscal
ABSTRACT Conventional macroeconomics has viewed inflation as a monetary phenomenon through the quantity theory of money. Ever‐increasing sovereign debt globally has caused concern amongst economists. These concerns follow not from the ability of governments to repay their debt, but rather the impact of sizeable debt portfolios on price levels.
Guangling Liu, Christopher D. Solomon
wiley +1 more source
Incomplete Cholesky factorization [PDF]
The thesis is about the incomplete Cholesky factorization and its va- riants, which are important for preconditioning a system with symmetric and positive definite matrix.
Hoang, Phuong Thao
core
Convolutional neural network-driven preconditioners for conjugate gradients
We present a data-driven approach for preconditioning large sparse symmetric positive definite linear systems using convolutional neural networks tailored for sparse tensor inputs.
Johannes Sappl +3 more
doaj +1 more source
How to enviromically predict breeding genotypes as if they were commercial cultivars?
Abstract Early trial rankings may not translate into cultivar‐stage performance, especially when genotype‐by‐environment interaction changes the target response across breeding stages. This study implemented and evaluated a bi‐trait genomic–enviromic reaction‐norm framework to predict breeding genotypes “as cultivars” by combining genomic relationships,
Rafael Tassinari Resende
wiley +1 more source

