Related Experiment Video
Updated: Feb 15, 2026

12:03
A Method for Tracking the Time Evolution of Steady-State Evoked Potentials
Published on: May 25, 2019
8.9K
Discrete maximal regularity of time-stepping schemes for fractional evolution equations
Bangti Jin1, Buyang Li2, Zhi Zhou2
11Department of Computer Science, University College London, Gower Street, London, WC1E 6BT UK.
Summary
This study analyzes time stepping schemes for fractional evolution models, establishing maximal regularity for methods like convolution quadratures and the L1 scheme. These findings extend results for parabolic problems.
Area of Science:
- Numerical Analysis
- Fractional Calculus
- Partial Differential Equations
Background:
- Fractional evolution models involve fractional derivatives in time, presenting unique analytical challenges.
- Understanding the regularity of numerical solutions is crucial for stability and accuracy.
- Existing methods for parabolic problems need extension to fractional settings.
Purpose of the Study:
- To establish maximal [Formula: see text]-regularity for various time stepping schemes applied to fractional evolution models.
- To analyze the performance of specific numerical methods including convolution quadratures, L1 scheme, and fractional Crank-Nicolson.
- To generalize existing regularity results from parabolic problems to fractional evolution equations.
Main Methods:
- Application of operator-valued Fourier multiplier theorems (Weis, Blunck) for theoretical analysis.
- Analysis of convolution quadratures generated by backward Euler and second-order backward difference formulas.
- Investigation of the L1 scheme, explicit Euler method, and a fractional Crank-Nicolson variant.
Main Results:
- Maximal [Formula: see text]-regularity is established for the considered time stepping schemes.
- The analysis provides a rigorous framework for assessing the regularity of numerical solutions for fractional models.
- The findings demonstrate the applicability and effectiveness of these schemes in the context of fractional calculus.
Conclusions:
- The established maximal [Formula: see text]-regularity results offer significant advancements in the numerical analysis of fractional evolution equations.
- These findings generalize and extend previous results known for parabolic problems.
- The study provides a robust theoretical foundation for the numerical simulation of fractional dynamics.
Related Concept Videos
Discrete-time Fourier transform
1.2K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
1.2K
Basic Discrete Time Signals
746
The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
746
Discrete-Time Fourier Series
727
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
727
The Evidence for Evolution
48.4K
Genetic variations accumulating within populations over generations give rise to biological evolution. Evolutionary changes can result in the formation of novel varieties and entire new species. These changes are responsible for the diverse forms of life inhabiting the planet. The evidence for evolution suggests that all living organisms descended from common ancestors.
48.4K
BIBO stability of continuous and discrete -time systems
949
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
949
Convergent Evolution
33.1K
Evolution shapes the features of organisms over time, ensuring that they are suited for the environments in which they live. Sometimes, selection pressure leads to the rise of similar but unrelated adaptations in organisms with no recent common ancestors, a process known as convergent evolution.
33.1K

