About: On a maximum attainable accuracy of some segregated techniques for saddle point problems     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
  • V tomto příspěvku analyzujeme numerické chování některých iteračních metod pro řešení rozsáhlých úloh sedlového bodu: metody redukce na Schurův doplněk a metody projekce na nulový prostor. Obě metody jsou založené na transformaci původního problému na problém redukovaný, který je řešen iteračně (např. metodou největšího spádu nebo metodou sdružených gradientů), čímž dostaneme aproximace jedné blokocé složky vektoru řešení. Zbývající složka je nalezena zpětnou substitucí do původní soustavy. V závislosti na skutečné implementaci odhadujeme maximální dosažitelnou přesnost spočteného řešení. (cs)
  • In this contribution we analyze numerical behavior of some iterative methods used for solving large-scale saddle point problems. Two representatives of such methods are the Schur complement reduction method and the null-space projection method. They are both based on the transformation of the original problem to the reduced form which is solved iteratively (e.g. by the stepest descent or the conjugate gradient method etc.) giving one block component of the solution vector. The remaining unknowns are solved by back-substitution from the original system. Depending on the actual implementation, we estimate the maximum attainable accuracy of the computed approximate solution.
  • In this contribution we analyze numerical behavior of some iterative methods used for solving large-scale saddle point problems. Two representatives of such methods are the Schur complement reduction method and the null-space projection method. They are both based on the transformation of the original problem to the reduced form which is solved iteratively (e.g. by the stepest descent or the conjugate gradient method etc.) giving one block component of the solution vector. The remaining unknowns are solved by back-substitution from the original system. Depending on the actual implementation, we estimate the maximum attainable accuracy of the computed approximate solution. (en)
Title
  • On a maximum attainable accuracy of some segregated techniques for saddle point problems
  • On a maximum attainable accuracy of some segregated techniques for saddle point problems (en)
  • O maximální dosažitelné přesnosti některých segregovaných technik pro sedlobodové problémy (cs)
skos:prefLabel
  • On a maximum attainable accuracy of some segregated techniques for saddle point problems
  • On a maximum attainable accuracy of some segregated techniques for saddle point problems (en)
  • O maximální dosažitelné přesnosti některých segregovaných technik pro sedlobodové problémy (cs)
skos:notation
  • RIV/46747885:24220/06:@0000003!RIV07-MSM-24220___
http://linked.open.../vavai/riv/strany
  • 26 – 34
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0554)
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
  • 490245
http://linked.open...ai/riv/idVysledku
  • RIV/46747885:24220/06:@0000003
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • %22saddle point problems; Schur complement reduction method; null-space projection method; rounding error analysis%22 (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [8DE6ED027491]
http://linked.open...v/mistoKonaniAkce
  • Monínec, Sedlec-Prčice
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...i/riv/nazevZdroje
  • Doktorandský den 2006
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
  • Jiránek, Pavel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Ústav informatiky AV ČR
https://schema.org/isbn
  • 80-86732-87-8
http://localhost/t...ganizacniJednotka
  • 24220
is http://linked.open...avai/riv/vysledek of
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, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software