About: Semi-sparse Cholesky Factorization     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The Cholesky factorization (shortly CHF) is one of basic methods to solve systems of linear equations (shortly SLEs). A task of the CHF is to compute the matrix L, such that A=LL^T. The big advantage of this method is that is possible to solve a set of SLEs with the same matrix A, but with different right hand sides. The process of Cholesky factorization of the originally sparse matrix A leads to the matrix L with new nonzero elements, called fills (or fill-in's). For the minimal number of fills, special process called symbolic factorization is needed. Since this process significantly increases the number of required operations, the efficient computation of the CHF for sparse matrices is a still open research problem
  • The Cholesky factorization (shortly CHF) is one of basic methods to solve systems of linear equations (shortly SLEs). A task of the CHF is to compute the matrix L, such that A=LL^T. The big advantage of this method is that is possible to solve a set of SLEs with the same matrix A, but with different right hand sides. The process of Cholesky factorization of the originally sparse matrix A leads to the matrix L with new nonzero elements, called fills (or fill-in's). For the minimal number of fills, special process called symbolic factorization is needed. Since this process significantly increases the number of required operations, the efficient computation of the CHF for sparse matrices is a still open research problem (en)
  • Choleskyho faktorizace (CHF) je jednou ze základních metod pro řešení soustav lineárních rovnic (SLR). Výhodou faktorizace je snadná možnost řešení více SLR (se stejnou maticí soustavy ale jinou pravou stranou). Bohužel faktorizace řídké matice může vést na hustou matice. Pro odstranění tohoto nedostatku je nutný speciální proces zvaný %22symbolická faktorizace%22. Tato práce řeší problém pro částečně řídké matice. (cs)
Title
  • Choleskyho faktorizace pro částečně řídké matice (cs)
  • Semi-sparse Cholesky Factorization
  • Semi-sparse Cholesky Factorization (en)
skos:prefLabel
  • Choleskyho faktorizace pro částečně řídké matice (cs)
  • Semi-sparse Cholesky Factorization
  • Semi-sparse Cholesky Factorization (en)
skos:notation
  • RIV/68407700:21230/05:03107570!RIV06-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(IBS3086102), Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 542291
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/05:03107570
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Cholesky factorization; High-performance; numerical algebra; sparse matrix (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...i/riv/kodPristupu
http://linked.open...ontrolniKodProRIV
  • [90EE50B172C4]
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...n/vavai/riv/nosic
  • neuvedeno
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Šimeček, Ivan
http://linked.open...n/vavai/riv/zamer
https://schema.org/isbn
  • 80-01-03201-9
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software