Publication

Adaptive reduced basis finite element heterogeneous multiscale method

Assyr Abdulle, Yun Bai
2013
Journal Articles

Abstract

An adaptive reduced basis finite element heterogeneous multiscale method (RB-FE-HMM) is proposed for elliptic problems with multiple scales. The multiscale method is based on the RB-FE-HMM introduced in [A. Abdulle, Y. Bai, Reduced basis finite element heterogeneous multiscale method for high-order discretizations of elliptic homogenization problems, J. Comput. Phys. 231 (21) (2012) 7014-7036]. It couples a macroscopic solver with effective data recovered from the solution of micro problems solved on sampling domains. Unlike classical numerical homogenization methods, the micro problems are computed in a finite dimensional space spanned by a small number of accurately computed representative micro solutions (the reduced basis) obtained by a greedy algorithm in an offline stage. In this paper we present a residual-based a posteriori error analysis in the energy norm as well as an a posteriori error analysis in quantities of interest. For both type of adaptive strategies, rigorous a posteriori error estimates are derived and corresponding error estimators are proposed. In contrast to the adaptive finite element heterogeneous multiscale method (FE-HMM), there is no need to adapt the micro mesh simultaneously to the macroscopic mesh refinement. Up to an offline preliminary stage, the RB-FE-HMM has the same computational complexity as a standard adaptive FEM for the effective problem. Two and three dimensional numerical experiments confirm the efficiency of the RB-FE-HMM and illustrate the improvements compared to the adaptive FE-HMM. (C) 2013 Elsevier B.V. All rights reserved.

Official source

https://infoscience.epfl.ch/entities/publication/4e176fc2-6d0b-46b6-9752-35e08f7bec3c

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Assyr Abdulle, Yun Bai
2013
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/4e176fc2-6d0b-46b6-9752-35e08f7bec3c

About this result

Related concepts (32)

Estimator

In statistics, an estimator is a rule for calculating an estimate of a given quantity based on observed data: thus the rule (the estimator), the quantity of interest (the estimand) and its result (the estimate) are distinguished. For example, the sample mean is a commonly used estimator of the population mean. There are point and interval estimators. The point estimators yield single-valued results. This is in contrast to an interval estimator, where the result would be a range of plausible values.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Related publications (30)

Anisotropic Adaptive Finite Elements for a p-Laplacian Problem

Marco Picasso, Paride Passelli

The p-Laplacian problem -del & sdot; ((mu + |del u|(p-2))del u) = f is considered, where mu is a given positive number. An anisotropic a posteriori residual-based error estimator is presented. The error estimator is shown to be equivalent, up to higher ord ...

Walter De Gruyter Gmbh2024

Spectral Estimators for High-Dimensional Matrix Inference

Farzad Pourkamali

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

EPFL2024

Statistical Inference for Inverse Problems: From Sparsity-Based Methods to Neural Networks

Pakshal Narendra Bohra

In inverse problems, the task is to reconstruct an unknown signal from its possibly noise-corrupted measurements. Penalized-likelihood-based estimation and Bayesian estimation are two powerful statistical paradigms for the resolution of such problems. They ...

EPFL2024