About: The Regularizing Effect of the Golub-Kahan Iterative Bidiagonalization and Revealing the Noise Level in the Data     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
  • Regularization techniques based on the Golub-Kahan iterative bidiagonalization belong among popular approaches for solving large ill-posed problems. First, the original problem is projected onto a lower dimensional subspace using the bidiagonalization algorithm, which by itself represents a form of regularization by projection. The projected problem, however, inherits a part of the ill-posedness of the original problem, and therefore some form of inner regularization must be applied. Stopping criteria for the whole process are then based on the regularization of the projected (small) problem. In this paper we consider an ill-posed problem with a noisy right-hand side (observation vector), where the noise level is unknown. We show how the information from the Golub-Kahan iterative bidiagonalization can be used for estimating the noise level. Such information can be useful for constructing efficient stopping criteria in solving ill-posed problems.
  • Regularization techniques based on the Golub-Kahan iterative bidiagonalization belong among popular approaches for solving large ill-posed problems. First, the original problem is projected onto a lower dimensional subspace using the bidiagonalization algorithm, which by itself represents a form of regularization by projection. The projected problem, however, inherits a part of the ill-posedness of the original problem, and therefore some form of inner regularization must be applied. Stopping criteria for the whole process are then based on the regularization of the projected (small) problem. In this paper we consider an ill-posed problem with a noisy right-hand side (observation vector), where the noise level is unknown. We show how the information from the Golub-Kahan iterative bidiagonalization can be used for estimating the noise level. Such information can be useful for constructing efficient stopping criteria in solving ill-posed problems. (en)
Title
  • The Regularizing Effect of the Golub-Kahan Iterative Bidiagonalization and Revealing the Noise Level in the Data
  • The Regularizing Effect of the Golub-Kahan Iterative Bidiagonalization and Revealing the Noise Level in the Data (en)
skos:prefLabel
  • The Regularizing Effect of the Golub-Kahan Iterative Bidiagonalization and Revealing the Noise Level in the Data
  • The Regularizing Effect of the Golub-Kahan Iterative Bidiagonalization and Revealing the Noise Level in the Data (en)
skos:notation
  • RIV/67985807:_____/09:00329240!RIV10-AV0-67985807
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(IAA100300802), S, Z(AV0Z10300504), Z(MSM0021620839)
http://linked.open...iv/cisloPeriodika
  • 4
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
  • 338685
http://linked.open...ai/riv/idVysledku
  • RIV/67985807:_____/09:00329240
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • ill-posed problems; Golub-Kahan iterative bidiagonalization; Lanczos tridiagonalization; noise revealing (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • SE - Švédské království
http://linked.open...ontrolniKodProRIV
  • [3126C15C89AE]
http://linked.open...i/riv/nazevZdroje
  • Bit
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...v/svazekPeriodika
  • 49
http://linked.open...iv/tvurceVysledku
  • Strakoš, Zdeněk
  • Plešinger, Martin
  • Hnětynková, Iveta
http://linked.open...ain/vavai/riv/wos
  • 000271948000002
http://linked.open...n/vavai/riv/zamer
issn
  • 0006-3835
number of pages
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software