Fourier series (based) multiscale method for computational analysis in science and engineering: V. Fourier series multiscale solution for elastic bending of Reissner plates on Pasternak foundations

Weiming Sun; Zimao Zhang

Home/Archive/arXiv

arXiv · 2208.11363

Fourier series (based) multiscale method for computational analysis in science and engineering: V. Fourier series multiscale solution for elastic bending of Reissner plates on Pasternak foundations

Weiming Sun·Zimao Zhang

View original source ↗Read source document ↗Export metadata ↓

Abstract

Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the fifth paper, the usual structural analysis of plates on an elastic foundation is extended to a thorough multiscale analysis for a system of a fourth order linear differential equation (for transverse displacement of the plate) and a second order linear differential equation (for the stress function), where general boundary conditions and a wide spectrum of model parameters are prescribed. For this purpose, the solution function each is expressed as a linear combination of the corner function, the two boundary functions and the internal function, to ensure the series expression obtained uniformly convergent and termwise differentiable up to fourth (or second) order. Meanwhile, the sum of the corner function and the internal function corresponds to the particular solution, and the two boundary functions correspond to the general solutions which satisfy the homogeneous form of the equation. With the corner function, the two boundary functions and the internal function selected specifically as polynomials, one-dimensional half-range Fourier series along the y (or x)-direction, and two-dimensional half-range Fourier series, the Fourier series multiscale solution of the bending problem of a Reissner plate on the Pasternak foundation is derived. And then the convergence characteristics of the Fourier series multiscale solution are investigated with numerical examples, and the multiscale characteristics of the bending problem of a Reissner plate on the Pasternak foundation are demonstrated for a wide spectrum of model parameters.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Weiming Sun, Zimao Zhang. 2022-08-24. Fourier series (based) multiscale method for computational analysis in science and engineering: V. Fourier series multiscale solution for elastic bending of Reissner plates on Pasternak foundations. https://arxiv.org/abs/2208.11363

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗

arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗

arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗