One-dimensional fourth-order boundary value problems (BVPs) play a critical role in engineering applications, particularly in the analysis of beams. Current numerical investigations primarily concentrate on homogeneous boundary conditions. In addition to its high precision advantages, the Hermite finite element method (HFEM) is capable of directly computing both the function value and its derivatives. In this paper, both the cubic and quintic HFEM are employed to address two prevalent non-homogeneous fourth-order BVPs. Furthermore, a priori error estimations are established for both BVPs, demonstrating the optimal error convergence order in semi-norm and norm. Finally, a numerical simulation is presented to validate the theoretical results.
Inspired by Polyak’s heavy-ball method, this paper proposes an adaptive deterministic block coordinate descent method with momentum (mADBCD) for efficiently solving large-scale linear least-squares problems. The proposed method introduces a novel column selection criterion based on the Euclidean norm of the residual vector of the normal equation. In contrast to classical block coordinate descent methods, mADBCD does not require a fixed pre-partitioning of the column indices of the coefficient matrix and avoids the expensive computation of Moore-Penrose pseudoinverses of submatrices at each iteration. The method adaptively updates the block index set at each step, thereby improving both flexibility and scalability. When the coefficient matrix is of full column rank, we prove that mADBCD converges linearly to the unique solution of the least-squares problem. Numerical experiments are conducted to show that mADBCD outperforms several recent block coordinate descent methods in terms of iteration count and CPU time. In particular, when solving extremely sparse least-squares problems, mADBCD is the first block coordinate descent method reported to achieve CPU time nearly comparable to that of the classical least squares QR (LSQR) method [Paige and Saunders, ACM Trans. Math. Softw., 8 (1982)].
In this work, we first present an adaptive deterministic block coordinate descent method with momentum (mADBCD) to solve the linear least-squares problem, which is based on Polyak's heavy ball method and a new column selection criterion for a set of block-controlled indices defined by the Euclidean norm of the residual vector of the normal equation. The mADBCD method eliminates the need for pre-partitioning the column indexes of the coefficient matrix, and it also obviates the need to compute the Moore-Penrose pseudoinverse of a column sub-matrix at each iteration. Moreover, we demonstrate the adaptability and flexibility in the automatic selection and updating of the block control index set. When the coefficient matrix has full rank, the theoretical analysis of the mADBCD method indicates that it linearly converges towards the unique solution of the linear least-squares problem. Furthermore, by effectively integrating count sketch technology with the mADBCD method, we also propose a novel count sketch adaptive block coordinate descent method with momentum (CS-mADBCD) for solving highly overdetermined linear least-squares problems and analysis its convergence. Finally, numerical experiments illustrate the advantages of the proposed two methods in terms of both CPU times and iteration counts compared to recent block coordinate descent methods.
This paper investigates a novel nonconforming virtual element method (VEM) for solving the Kirchhoff plate obstacle problem, which is described by a fourth-order variational inequality (VI) of the first kind. In our study, we distinguish our approach by introducing new internal degrees of freedom to the traditional lowest-order nonconforming VEM, which originally lacked such degrees. This addition not only facilitates error estimation but also enhances its intuitiveness. Importantly, our novel nonconforming VEM naturally satisfies the constraints of the obstacle problem. We then establish an a priori error estimate for our novel nonconforming VEM, with the result indicating that the lowest order of our method achieves optimal convergence. Finally, we present a numerical example to validate the theoretical result.