Chebyshev spectral collocation method approximations of the Stokes eigenvalue problem based on penalty techniques

Date

2019-11-01

Author

Türk, Önder

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

183
views

0
downloads

Numerical solution strategies for the Stokes eigenvalue problem based on the use of penalty formulations are investigated in this study. It is shown that the penalty method approach can successfully be adapted for the eigenproblem to rectify the associated problems such as the existence of zero diagonal entries in the resulting algebraic system. Two different schemes, namely, the standard penalisation with a small penalty parameter, and the iterative penalisation that enables relatively large parameters, are implemented. The employment of the latter leads to a so-called inhomogeneous generalised eigenvalue problem which requires a special attention. A feasible solution strategy is presented which is adapted from a procedure based on Newton's method proposed for the corresponding standard (inhomogeneous) eigenvalue problems. Concerning the spatial discretisation, among other possible options, the Chebyshev spectral collocation method based on expanding the unknown fields in tensor product of Chebyshev polynomials is employed. It is shown that the method constitutes a novel way of efficiently examining the approximate eigensolutions of the Stokes operator with the use of Chebyshev spectral collocation method directly, without a decoupling of velocity and pressure. (C) 2019 IMACS. Published by Elsevier B.V. All rights reserved.

Subject Keywords

Applied Mathematics, Numerical Analysis, Computational Mathematics

URI

https://hdl.handle.net/11511/56232

Journal

APPLIED NUMERICAL MATHEMATICS

DOI

https://doi.org/10.1016/j.apnum.2019.06.005

Collections

Graduate School of Applied Mathematics, Article

Suggestions

OpenMETU
Core

Chebyshev Center Computation on Probability Simplex With alpha-Divergence Measure Candan, Çağatay (Institute of Electrical and Electronics Engineers (IEEE), 2020-01-01) Chebyshev center computation problem, i.e. finding the point which is at minimum distance to a set of given points, on the probability simplex with alpha-divergence distancemeasure is studied. The proposed solution generalizes the ArimotoBlahut (AB) algorithm utilizing Kullback-Leibler divergence to alpha-divergence, and reduces to the AB method as a. 1. Similar to the AB algorithm, themethod is an ascent method with a guarantee onthe objective value (alpha-mutual information or Chebyshev radius) improvemen...
A DRBEM approximation of the Steklov eigenvalue problem Türk, Önder (Elsevier BV, 2021-01-01) In this study, we propose a novel approach based on the dual reciprocity boundary element method (DRBEM) to approximate the solutions of various Steklov eigenvalue problems. The method consists in weighting the governing differential equation with the fundamental solutions of the Laplace equation where the definition of interior nodes is not necessary for the solution on the boundary. DRBEM constitutes a promising tool to characterize such problems due to the fact that the boundary conditions on part or all...
Counting Boolean functions with specified values in their Walsh spectrum Uyan, Erdener; Calik, Cagdas; Doğanaksoy, Ali (Elsevier BV, 2014-03-15) The problem of counting Boolean functions with specified number s of Walsh coefficients omega in their Walsh spectrum is discussed in this paper. Strategies to solve this problem shall help solving many more problems related to desired cryptographic features of Boolean functions such as nonlinearity, resiliency, algebraic immunity, etc. In an attempt to study this problem, we present a new framework of solutions. We give results for vertical bar omega vertical bar >= 2(n-1) and for all s, in line with a pre...
LYAPUNOV-TYPE INEQUALITIES FOR PLANAR LINEAR DYNAMIC HAMILTONIAN SYSTEMS Bohner, Martin; Zafer, Ağacık (National Library of Serbia, 2013-04-01) We give new Lyapunov-type inequalities for linear Hamiltonian systems on arbitrary time scales, which improve recently published results and hence all the related ones in the literature. As an application, we obtain new diconjugacy criteria for linear Hamiltonian systems.
On the smoothness of solutions of impulsive autonomous systems Akhmet, Marat (Elsevier BV, 2005-01-01) The aim of this paper is to investigate dependence of solutions on parameters for nonlinear autonomous impulsive differential equations. We will specify what continuous, differentiable and analytic dependence of solutions on parameters is, define higher order derivatives of solutions with respect to parameters and determine conditions for existence of such derivatives. The theorem of analytic dependence of solutions on parameters is proved.

Citation Formats

Ö. Türk, “Chebyshev spectral collocation method approximations of the Stokes eigenvalue problem based on penalty techniques,” APPLIED NUMERICAL MATHEMATICS, pp. 188–200, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56232.