<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Math Alexei Gazca</title>
	<atom:link href="https://dcn.nat.fau.eu/category/math/posts-alexei-gazca/feed/" rel="self" type="application/rss+xml" />
	<link>https://dcn.nat.fau.eu</link>
	<description>FAU DCN-AvH. Chair for Dynamics, Control, Machine Learning and Numerics -Alexander von Humboldt Professorship</description>
	<lastBuildDate>Fri, 10 Mar 2023 06:36:08 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.0</generator>

<image>
	<url>https://dcn.nat.fau.eu/wp-content/uploads/cropped-FAUDCNAvHlogo_square_silhouette_512x512-32x32.png</url>
	<title>Math Alexei Gazca</title>
	<link>https://dcn.nat.fau.eu</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Augmented Lagragian preconditioners for incompressible flow</title>
		<link>https://dcn.nat.fau.eu/augmented-lagragian-preconditioners-for-incompressible-flow/</link>
		
		<dc:creator><![CDATA[darlis.dcn]]></dc:creator>
		<pubDate>Thu, 09 Dec 2021 07:24:33 +0000</pubDate>
				<category><![CDATA[Hub]]></category>
		<category><![CDATA[Hub Alexei Gazca]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[Math Alexei Gazca]]></category>
		<guid isPermaLink="false">https://dcn.nat.fau.eu/?p=13534</guid>

					<description><![CDATA[Author: Alexei Gazca, FAU DCN-AvH Code:   Below is a description of the types of problems that can be tackled using the code contained in this repository. Solving linear systems arising from the discretisation of partial differential equations can be an extremely challenging and computationally intensive task, especially for problems posed in more than two [&#8230;]]]></description>
		
		
		
			</item>
	</channel>
</rss>
