LISTSERV mailing list manager LISTSERV 16.5

Help for MATHTALK Archives


MATHTALK Archives

MATHTALK Archives


MATHTALK@LISTSERV.UTK.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

MATHTALK Home

MATHTALK Home

MATHTALK  October 2021

MATHTALK October 2021

Subject:

CAM Seminar today @ 3:35pm

From:

asalgad1 <[log in to unmask]>

Reply-To:

asalgad1 <[log in to unmask]>

Date:

Wed, 13 Oct 2021 19:21:50 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (1 lines)

There is an in-person CAM seminar today @ 3:35pm (In 15 minutes)!

It will take place in

Ayres 112

Title + abstract are below.

Best,
Abner

Speaker: Stefan Schnake

Affiliation: ORNL

 

Title: Title Residual based rank adaptive algorithms for dynamic low-
rank approximation 

Abstract: Numerical discretizations of kinetic equations often suffer
from the curse of dimensionality which makes full resolution
computations intractable. A recent and popular technique to reduce the
order of complexity for these systems is Koch and Lubich’s Dynamic Low-
Rank Approximation (DLRA) which seeks to evolve the PDE on a low-rank
manifold. Numerical integrators utilizing DLRA accurately capture low-
rank features of kinetic systems by updating the global basis functions
in time, but few give indicators for when to adaptively increase the
rank of the solution. In this talk, we first present a formulation of
standard discontinuous Galerkin methods as a semi-discrete matrix-
valued ODE which is low memory, provides computationally efficient
evaluations of the discrete operator and easily fits the target
framework of DLRA. Second, we present residual-based indicators for
when to increase the rank of the DLRA solution and which basis vectors
should be added in order to optimally increase accuracy. These
residual-based estimators are also low memory and can be cheaply
computed. Low- and high-rank numerical examples are given at the end of
the talk.0



=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-

To leave the list go here:
https://listserv.utk.edu/cgi-bin/wa?SUBED1=MATHTALK&A=1

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

May 2024
April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
May 2021
April 2021
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018

ATOM RSS1 RSS2



LISTSERV.UTK.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager