A sparse FFT approach for ODE with random coefficients

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

ISSN: 1572-9044

Extent: Online-Ressource

Language: Englisch

Notes: online resource.

Bibliographic citation: A sparse FFT approach for ODE with random coefficients ; volume:46 ; number:5 ; day:19 ; month:7 ; year:2020 ; pages:1-21 ; date:9.2020
Advances in computational mathematics ; 46, Heft 5 (19.7.2020), 1-21, 9.2020

Creator: Bochmann, Maximilian
Kämmerer, Lutz
Potts, Daniel

Contributor: SpringerLink (Online service)

DOI: 10.1007/s10444-020-09807-w

URN: urn:nbn:de:101:1-2020091322265385602810

Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:56 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Bochmann, Maximilian
Kämmerer, Lutz
Potts, Daniel
SpringerLink (Online service)

Other Objects (12)

The uniform sparse FFT with application to PDEs with random coefficients

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Hochschulschrift

Deterministic Sparse FFT Algorithms

Deterministic Sparse Sublinear FFT with Improved Numerical Stability

Sparse random models in combinatorics

Random perturbation of sparse graphs

Hochschulschrift

Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling

Hochschulschrift

Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

Arbeitspapier

The triangular model with random coefficients

The rank of sparse random matrices

The uniform sparse FFT with application to PDEs with random coefficients

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Hochschulschrift

Deterministic Sparse FFT Algorithms

Deterministic Sparse Sublinear FFT with Improved Numerical Stability

Sparse random models in combinatorics

Random perturbation of sparse graphs

Hochschulschrift

Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling

Hochschulschrift

Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

Arbeitspapier

The triangular model with random coefficients

The rank of sparse random matrices

The uniform sparse FFT with application to PDEs with random coefficients

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Hochschulschrift

Deterministic Sparse FFT Algorithms

Deterministic Sparse Sublinear FFT with Improved Numerical Stability

Sparse random models in combinatorics

Random perturbation of sparse graphs

Hochschulschrift

Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling

Hochschulschrift

Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

Arbeitspapier

The triangular model with random coefficients

The rank of sparse random matrices

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

A sparse FFT approach for ODE with random coefficients

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (12)

The uniform sparse FFT with application to PDEs with random coefficients

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Deterministic Sparse FFT Algorithms

Deterministic Sparse Sublinear FFT with Improved Numerical Stability

Sparse random models in combinatorics

Random perturbation of sparse graphs

Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling

Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

The triangular model with random coefficients

The rank of sparse random matrices

The rank of sparse random matrices

The uniform sparse FFT with application to PDEs with random coefficients

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Deterministic Sparse FFT Algorithms

Deterministic Sparse Sublinear FFT with Improved Numerical Stability

Sparse random models in combinatorics

Random perturbation of sparse graphs

Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling

Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

The triangular model with random coefficients

The rank of sparse random matrices

The rank of sparse random matrices

The uniform sparse FFT with application to PDEs with random coefficients

Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

Deterministic Sparse FFT Algorithms

Deterministic Sparse Sublinear FFT with Improved Numerical Stability

Sparse random models in combinatorics

Random perturbation of sparse graphs

Multivariate Approximation and high-dimensional sparse FFT based on rank-1 lattice sampling

Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

The triangular model with random coefficients

The rank of sparse random matrices

The rank of sparse random matrices

Related objects

Reset password