flaggy
发表于 2025-3-25 03:50:03
http://reply.papertrans.cn/88/8739/873898/873898_21.png
nugatory
发表于 2025-3-25 09:15:14
http://reply.papertrans.cn/88/8739/873898/873898_22.png
外面
发表于 2025-3-25 13:00:34
High-Order Adaptive Galerkin Methods analysis of convergence and optimality properties reveals a sparsity degradation for Gevrey classes. We next turn our attention to the .-version of the finite element method, design an adaptive scheme which hinges on a recent algorithm by P. Binev for adaptive .-approximation, and discuss its optimality properties.
coddle
发表于 2025-3-25 16:32:36
Computational Comparison of Continuous and Discontinuous Galerkin Time-Stepping Methods for Nonlineaistence results for the continuous and discontinuous Galerkin time stepping methods for nonlinear initial value problems, 2014, Submitted), and provide a numerical comparison of the two time discretization methods.
潜伏期
发表于 2025-3-25 23:02:18
Recovering Piecewise Smooth Functions from Nonuniform Fourier Measurementsf splines or (piecewise) polynomials. We analyze the relation between the dimension of the reconstruction space and the bandwidth of the nonuniform samples, and show that it is linear for splines and piecewise polynomials of fixed degree, and quadratic for piecewise polynomials of varying degree.
confederacy
发表于 2025-3-26 03:54:51
http://reply.papertrans.cn/88/8739/873898/873898_26.png
NAVEN
发表于 2025-3-26 08:15:46
http://reply.papertrans.cn/88/8739/873898/873898_27.png
内向者
发表于 2025-3-26 09:57:16
http://reply.papertrans.cn/88/8739/873898/873898_28.png
Moderate
发表于 2025-3-26 14:15:06
High-Order Upwind Methods for Wave Equations on Curvilinear and Overlapping Gridsds are used to represent geometric complexity. The method of manufactured solutions is used to demonstrate that the dissipation introduced through upwinding is sufficient to stabilize the wave equation in the presence of overlapping grid interpolation.
Mammal
发表于 2025-3-26 19:54:08
Generalized Summation by Parts Operators: Second Derivative and Time-Marching Methodsn GSBP operators can be more efficient than those based on classical SBP operators, as they minimize the number of solution points which must be solved simultaneously. Furthermore, we demonstrate the link between GSBP operators and Runge-Kutta time-marching methods.