<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://www.zbc.uz.zgora.pl/repozytorium/style/common/xsl/oai-style.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
         http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-06-28T09:25:43Z</responseDate>
	<request identifier="oai:zbc.uz.zgora.pl:58804" metadataPrefix="oai_dc" verb="GetRecord">
	https://zbc.uz.zgora.pl/repozytorium/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:zbc.uz.zgora.pl:58804</identifier>
	    <datestamp>2025-07-14T12:34:36Z</datestamp>
		  <setSpec>DigitalLibraryZielonaGora</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:Faculties:FacultyComputerElectricalControl</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals:AMCS:AMCS01</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:Faculties</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:TypesWork</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:TypesWork:Articles</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals:AMCS</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="pl"><![CDATA[On the choice of subspace for iterative methods for linear discrete ill-posed problems]]></dc:title>
<dc:creator><![CDATA[Calvetti, Daniela]]></dc:creator>
<dc:creator><![CDATA[Lewis, Bryan]]></dc:creator>
<dc:creator><![CDATA[Reichel, Lothar]]></dc:creator>
<dc:subject xml:lang="pl"><![CDATA[minimal residual method]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[conjugate gradient methods]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[ill-posed problems]]></dc:subject>
<dc:description xml:lang="pl"><![CDATA[Many iterative methods for the solution of linear discrete ill-posed problems with a large matrix require the computed approximate solutions to be orthogonal to the null space of the matrix. We show that when the desired solution is not smooth, it may be possible to determine meaningful approximate solutions with less computational work by not imposing this orthogonality condition.]]></dc:description>
<dc:publisher><![CDATA[Zielona Góra: Uniwersytet Zielonogórski]]></dc:publisher>
<dc:contributor><![CDATA[Campbell, Stephen L. - ed.]]></dc:contributor>
<dc:date><![CDATA[2001]]></dc:date>
<dc:type xml:lang="pl"><![CDATA[artykuł]]></dc:type>
<dc:identifier><![CDATA[http://www.zbc.uz.zgora.pl/repozytorium/Content/58804/AMCS_2001_11_5_4.pdf]]></dc:identifier>
<dc:identifier><![CDATA[https://zbc.uz.zgora.pl/repozytorium/dlibra/publication/65589/edition/58804/content]]></dc:identifier>
<dc:identifier><![CDATA[oai:zbc.uz.zgora.pl:58804]]></dc:identifier>
<dc:source xml:lang="pl"><![CDATA[AMCS, volume 11, number 5 (2001)]]></dc:source>
<dc:source xml:lang="pl"><![CDATA[https://www.amcs.uz.zgora.pl/?action=papers&issue=51]]></dc:source>
<dc:language><![CDATA[eng]]></dc:language>
<dc:relation><![CDATA[oai:zbc.uz.zgora.pl:publication:65589]]></dc:relation>
<dc:rights xml:lang="pl"><![CDATA[Biblioteka Uniwersytetu Zielonogórskiego]]></dc:rights>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
