Arbitrary Order Research Articles

A Low-Latency High-Order Arithmetic to Boolean Masking Conversion

Masking, an effective countermeasure against side-channel attacks, is commonly applied in modern cryptographic implementations. Considering cryptographic algorithms that utilize both Boolean and arithmetic masking, the conversion algorithm between arithmetic masking and Boolean masking is required. Conventional high-order arithmetic masking to Boolean masking conversion algorithms based on Boolean circuits suffer from performance overhead, especially in terms of hardware implementation. In this work, we analyze high latency for the conversion and propose an improved high-order A2B conversion algorithm. For the conversion of 16-bit variables, the hardware latency can be reduced by 47% in the best scenario. For the case study of second-order 32-bit conversion, the implementation results show that the improved scheme reduces the clock cycle latency by 42% in hardware and achieves a 30% speed performance improvement in software. Theoretically, a security proof of arbitrary order is provided for the proposed high-order A2B conversion. Experimental validations are performed to verify the second-order DPA resistance of second-order implementation. The Test Vector Leakage Assessment does not observe side-channel leakage for hardware and software implementations.

Asymptotic behavior of solutions to nonclassical diffusion equations with degenerate memory and a time-dependent perturbed parameter

This article concerns the asymptotic behavior of solutions for a class of nonclassical diffusion equation with time-dependent perturbation coefficient and degenerate memory. We prove the existence and uniqueness of time-dependent global attractors in the family of time-dependent product spaces, by applying the operator decomposition technique and the contractive function method. Then we study the asymptotic structure of time-dependent global attractors as \(t\to \infty\). It is worth noting that the memory kernel function satisfies general assumption, and the nonlinearity \(f\) satisfies a polynomial growth of arbitrary order. For more information see https://ejde.math.txstate.edu/Volumes/2024/22/abstr.html

Carry Your Fault: A Fault Propagation Attack on Side-Channel Protected LWE-based KEM

Post-quantum cryptographic (PQC) algorithms, especially those based on the learning with errors (LWE) problem, have been subjected to several physical attacks in the recent past. Although the attacks broadly belong to two classes – passive side-channel attacks and active fault attacks, the attack strategies vary significantly due to the inherent complexities of such algorithms. Exploring further attack surfaces is, therefore, an important step for eventually securing the deployment of these algorithms. Also, it is mportant to test the robustness of the already proposed countermeasures in this regard. In this work, we propose a new fault attack on side-channel secure masked implementation of LWE-based key-encapsulation mechanisms (KEMs) exploiting fault propagation. The attack typically originates due to an algorithmic modification widely used to enable masking, namely the Arithmetic-to-Boolean (A2B) conversion. We exploit the data dependency of the adder carry chain in A2B and extract sensitive information, albeit masking (of arbitrary order) being present. As a practical demonstration of the exploitability of this information leakage, we show key recovery attacks of Kyber, although the leakage also exists for other schemes like Saber. The attack on Kyber targets the decapsulation module and utilizes Belief Propagation (BP) for key recovery. To the best of our knowledge, it is the first attack exploiting an algorithmic component introduced to ease masking rather than only exploiting the randomness introduced by masking to obtain desired faults (as done by Delvaux [Del22]). Finally, we performed both simulated and electromagnetic (EM) fault-based practical validation of the attack for an open-source first-order secure Kyber implementation running on an STM32 platform.

An open-source project for wind instrument modeling using digital waveguides

Digital waveguide methods for time-domain modeling of acoustic structures comprised of interconnected piece-wise one-dimensional cylinders, cones and toneholes have been well reported in the past. In this work, an open-source Matlab class is presented that can be used to model arbitrary wind instrument air column structures, defined by length, radii and hole geometric parameters, using digital waveguide methods. Fractional-delay filtering can be enabled or disabled, with support for both Thiran and Lagrange filter types of specified order. Thermoviscous losses can be modeling using either a discrete-time least squares or a shelf-filter fit, both of arbitrary order. Three different tonehole model options are provided (two-port, three-port or wave digital filter). End boundary conditions include closed, anechoic, ideally open, open flanged and open unflanged. The class object can be used either in single-sample iterative contexts (for example, with an attached excitation model) or with arbitrarily-sized input signals (for example, to compute a reflection function or impedance). The modeled geometry can be constructed manually by iteratively adding segments or holes, or a complete geometry can be specified in a file. This project is bundled together with a parallel and previously reported open-source project for frequency-domain transfer matrix modeling of air columns (https://github.com/garyscavone/acmt).

A compact simple HWENO scheme with ADER time discretization for hyperbolic conservation laws I: Structured meshes

In this paper, a compact and high order ADER (Arbitrary high order using DERivatives) scheme using the simple HWENO method (ADER-SHWENO) is proposed for hyperbolic conservation laws. The newly-developed method employs the Lax-Wendroff procedure to convert time derivatives to spatial derivatives, which provides the time evolution of the variables at the cell interfaces. This information is required for the simple HWENO reconstructions, which take advantages of the simple WENO and the classic HWENO. Compared with the original Runge-Kutta HWENO method (RK-HWENO), the new method has two advantages. Firstly, RK-HWENO method must solve the additional equations for reconstructions, which is avoided for the new method. Secondly, the SHWENO reconstruction is performed once with one stencil and is different from the classic HWENO methods, in which both the function and its derivative values are reconstructed with two different stencils, respectively. Thus the new method is more efficient than the RK-HWENO method. Moreover, the new method is more compact than the existing ADER-WENO method. Besides, the new method makes the best use of the information in the ADER method. Thus, the time evolution of the cell averages of the derivatives is simpler than that developed in the work (Li et al. (2021) [17]). Numerical tests indicate that the new method can achieve high order for smooth solutions both in space and time, keep non-oscillatory at discontinuities.

PREDICTIVE ASSESSMENT OF THE IMPACT OF CLIMATE CHANGE ON SUNFLOWER PRODUCTION: ANALYSIS OF DYNAMIC SERIES AND MODELING OF TRENDS

Sunflower production serves as an example of the close interaction between climate changes and the cultivation of technical crops, the replacement of cultivation of other crops with the cultivation of sunflower, taking into account such characteristics as its thermophilic nature, which in conditions of increased temperatures and drought makes it possible to maintain productivity. The conducted research indicates significant changes in the dynamics of production and yield of sunflower, in particular in connection with climate change and differences in weather conditions, which affect production and yield in different regions of Ukraine. The author singles out several periods in the growth of the sunflower market in terms of production and yield from 2008 to 2013 - a period of stability; slight declines in production and yield in 2009 and 2012; 2014 – a significant drop in production volumes and yields; 2015-2016 - the recovery period; 2017, 2020 and 2022 are periods of significant decline in production due to economic dynamics, the pandemic and the war in Ukraine; 2018-2019 and 2021 - growth in cultivation and harvest. The evaluation of the series of dynamics in the gross harvest of sunflower in Ukraine demonstrates a significant dependence of its production and yield on the external environment and market conditions. We will use a polynomial function of arbitrary order to model and forecast sunflower production and yield. Constructed polynomial trend models of sunflower production and yield with a high degree of reliability reflect the real dynamics of indicators and demonstrate both an accelerated reduction in certain periods of time in the production and yield of the crop, and growth in periods of economic recovery. The forecast of production volumes and yields of sunflower for 2023-2025 indicates stability in the dynamics of these indicators in the medium term.

Constructing polynomial libraries for reservoir computing in nonlinear dynamical system forecasting.

Reservoir computing is an effective model for learning and predicting nonlinear and chaotic dynamical systems; however, there remains a challenge in achieving a more dependable evolution for such systems. Based on the foundation of Koopman operator theory, considering the effectiveness of the sparse identification of nonlinear dynamics algorithm to construct candidate nonlinear libraries in the application of nonlinear data, an alternative reservoir computing method is proposed, which creates the linear Hilbert space of the nonlinear system by including nonlinear terms in the optimization process of reservoir computing, allowing for the application of linear optimization. We introduce an implementation that incorporates a polynomial transformation of arbitrary order when fitting the readout matrix. Constructing polynomial libraries with reservoir-state vectors as elements enhances the nonlinear representation of reservoir states and more easily captures the complexity of nonlinear systems. The Lorenz-63 system, the Lorenz-96 system, and the Kuramoto-Sivashinsky equation are used to validate the effectiveness of constructing polynomial libraries for reservoir states in the field of state-evolution prediction of nonlinear and chaotic dynamical systems. This study not only promotes the theoretical study of reservoir computing, but also provides a theoretical and practical method for the prediction of nonlinear and chaotic dynamical system evolution.

Nonlinear thermal buckling analysis of temperature-dependent porous annular and circular microplates reinforced by graphene platelets by using isogeometric analysis method

In this research, by using isogeometric analysis (IGA) method, nonlinear thermal buckling analysis of porous circular and annular microplates reinforced by graphene platelets (GPLs) under uniform temperature rise is performed by taking both the temperature dependence of the material properties and the size effects into account. The closed-cell metal foam scheme combined with the Halpin-Tsai micromechanics model and the rule of mixture is utilized to identify the effective material properties of the porous nanocomposites for three GPL dispersion patterns and three porosity distributions. With the aid of the virtual work principle, the classical and the non-classical motion equilibrium formulation based on the higher-order shear deformation theory in conjunction with the modified strain gradient (MSG) theory for the nonlinear temperature-dependent buckling behaviour are established. The higher-order NURBS basis functions capable of accomplishing easily the smoothness of arbitrary continuity order are successfully utilized to solve the nonlinear governing equations by satisfying the C2-continuity of the displacement field required by the MSG theory. The thermal buckling behaviour is assessed in detail by using various parameters such as the thickness-to-radius ratio, the porosity coefficient, the GPL weight fraction and the material length scale as well as the porosity distribution scheme and the GPL dispersion pattern. The results show the significance of incorporating the temperature dependency of the material properties when analyzing the thermal buckling behaviour and present the combination scheme of porosity and GPL distributions for enhancing the thermal buckling resistance.

Using spherical harmonics to solve the Boltzmann equation: an operator-based approach

ABSTRACT The transport of charged particles or photons in a scattering medium can be modelled with a Boltzmann equation. The mathematical treatment for scattering in such scenarios is often simplified if evaluated in a frame where the scattering centres are, on average, at rest. It is common therefore to use a mixed coordinate system, wherein space and time are measured in a fixed inertial frame, while momenta are measured in a ‘co-moving’ frame. To facilitate analytical and numerical solutions, the momentum dependence of the phase-space density may be expanded as a series of spherical harmonics, typically truncated at low order. A method for deriving the system of equations for the expansion coefficients of the spherical harmonics to arbitrary order is presented in the limit of isotropic, small-angle scattering. The method of derivation takes advantage of operators acting on the space of spherical harmonics. The matrix representations of these operators are employed to compute the system of equations. The computation of matrix representations is detailed and subsequently simplified with the aid of rotations of the coordinate system. The eigenvalues and eigenvectors of the matrix representations are investigated to prepare the application of standard numerical techniques, e.g. the finite volume method or the discontinuous Galerkin method, to solve the system.

Towards the full Heisenberg-Euler effective action at large N

We study the Heisenberg-Euler effective action in constant electromagnetic fields F¯\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\overline{F} $$\\end{document} for QED with N charged particle flavors of the same mass and charge e in the large N limit characterized by sending N → ∞ while keeping Ne2 ∼ eF¯\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ e\\overline{F} $$\\end{document} ∼ N0 fixed. This immediately implies that contributions that scale with inverse powers of N can be neglected and the resulting effective action scales linearly with N . Interestingly, due to the presence of one-particle reducible diagrams, even in this limit the Heisenberg-Euler effective action receives contributions of arbitrary loop order. In particular for the special cases of electric- and magnetic-like field configurations we construct an explicit expression for the associated effective Lagrangian that, upon extremization for two constant scalar coefficients, allows to evaluate its full, all-order result at arbitrarily large field strengths. We demonstrate that our manifestly nonperturbative expression correctly reproduces the known results for the Heisenberg-Euler effective action at large N , namely its all-loop strong field limit and its low-order perturbative expansion in powers of the fine-structure constant.

Quadratic differentials as stability conditions: Collapsing subsurfaces

Abstract We introduce a new class of triangulated categories, which are Verdier quotients of three-Calabi–Yau categories from (decorated) marked surfaces, and show that its spaces of stability conditions can be identified with moduli spaces of framed quadratic differentials on Riemann surfaces with arbitrary order zeros and arbitrary higher order poles. A main tool in our proof is a comparison of two exchange graphs, obtained by tilting hearts in the quotient categories and by flipping mixed angulations associated with the quadratic differentials.

Higher-order neurodynamical equation for simplex prediction

It is demonstrated that higher-order patterns beyond pairwise relations can significantly enhance the learning capability of existing graph-based models, and simplex is one of the primary form for graphically representing higher-order patterns. Predicting unknown (disappeared) simplices in real-world complex networks can provide us with deeper insights, thereby assisting us in making better decisions. Nevertheless, previous efforts to predict simplices suffer from two issues: (i) they mainly focus on 2- or 3-simplices, and there are few models available for predicting simplices of arbitrary orders, and (ii) they lack the ability to analyze and learn the features of simplices from the perspective of dynamics. In this paper, we present a Higher-order Neurodynamical Equation for Simplex Prediction of arbitrary order (HNESP), which is a framework that combines neural networks and neurodynamics. Specifically, HNESP simulates the dynamical coupling process of nodes in simplicial complexes through different relations (i.e., strong pairwise relation, weak pairwise relation, and simplex) to learn node-level representations, while explaining the learning mechanism of neural networks from neurodynamics. To enrich the higher-order information contained in simplices, we exploit the entropy and normalized multivariate mutual information of different sub-structures of simplices to acquire simplex-level representations. Furthermore, simplex-level representations and multi-layer perceptron are used to quantify the existence probability of simplices. The effectiveness of HNESP is demonstrated by extensive simulations on seven higher-order benchmarks. Experimental results show that HNESP improves the AUC values of the state-of-the-art baselines by an average of 8.32%. Our implementations will be publicly available at: https://github.com/jianruichen/HNESP.

The solvability of inhomogeneous boundary-value problems in Sobolev spaces

The aim of the paper is to develop a general theory of solvability of linear inhomogeneous boundary-value problems for systems of ordinary differential equations of arbitrary order in Sobolev spaces. Boundary conditions are allowed to be overdetermined or underdetermined. They may contain derivatives, of the unknown vector-valued function, whose integer or fractional orders exceed the order of the differential equation. Similar problems arise naturally in various applications. The theory introduces the notion of a rectangular number characteristic matrix of the problem. The index and Fredholm numbers of this matrix coincide, respectively, with the index and Fredholm numbers of the inhomogeneous boundary-value problem. Unlike the index, the Fredholm numbers (i.e., the dimensions of the problem kernel and co-kernel) are unstable even with respect to small (in the norm) finite-dimensional perturbations. We give examples in which the characteristic matrix can be explicitly found. We also prove a limit theorem for a sequence of characteristic matrices. Specifically, it follows from this theorem that the Fredholm numbers of the problems under investigation are semicontinuous in the strong operator topology. Such a property ceases to be valid in the general case.

Validation of symmetry-induced high moment velocity and temperature scaling laws in a turbulent channel flow.

The symmetry-based turbulence theory has been used to derive new scaling laws for the streamwise velocity and temperature moments of arbitrary order. For this, it has been applied to an incompressible turbulent channel flow driven by a pressure gradient with a passive scalar equationcoupled in. To derive the scaling laws, symmetries of the classical Navier-Stokes and the thermal energy equationshave been used together with statistical symmetries, i.e., the statistical scaling and translation symmetries of the multipoint moment equations. Specifically, the multipoint moments are built on the instantaneous velocity and temperature fields other than in the classical approach, where moments are based on the fluctuations of these fields. With this instantaneous approach, a linear system of multipoint correlation equationshas been obtained, which greatly simplifies the symmetry analysis. The scaling laws have been derived in the limit of zero viscosity and heat conduction, i.e., Re_{τ}→∞ and Pr>1, and they apply in the center of the channel, i.e., they represent a generalization of the deficit law, thus extending the work of Oberlack etal. [Phys. Rev. Lett. 128, 024502 (2022)0031-900710.1103/PhysRevLett.128.024502]. The scaling laws are all power laws, with the exponent of the high moments all depending exclusively on those of the first and second moments. To validate the new scaling laws, the data from a large number of direct numerical simulations (DNS) for different Reynolds and Prandtl numbers have been used. The results show a very high accuracy of the scaling laws to represent the DNS data. The statistical scaling symmetry of the multipoint moment equations, which characterizes intermittency, has been the key to the new results since it generates a constant in the exponent of the final scaling law. Most important, since this constant is independent of the order of the moments, it clearly indicates anomalous scaling.

Should Decisions in QCDCL Follow Prefix Order?

Quantified conflict-driven clause learning (QCDCL) is one of the main solving approaches for quantified Boolean formulas (QBF). One of the differences between QCDCL and propositional CDCL is that QCDCL typically follows the prefix order of the QBF for making decisions. We investigate an alternative model for QCDCL solving where decisions can be made in arbitrary order. The resulting system QCDCLANY\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf{QCDCL}^\ extsf {{A\ iny {\\MakeUppercase {ny}}}}$$\\end{document} is still sound and terminating, but does not necessarily allow to always learn asserting clauses or cubes. To address this potential drawback, we additionally introduce two subsystems that guarantee to always learn asserting clauses (QCDCLUNI-ANY\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf{QCDCL}^\ extsf {{U\ iny {\\MakeUppercase {ni}}-A\ iny {\\MakeUppercase {ny}}}}$$\\end{document}) and asserting cubes (QCDCLEXI-ANY\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf{QCDCL}^\ extsf {{E\ iny {\\MakeUppercase {xi}}-A\ iny {\\MakeUppercase {ny}}}}$$\\end{document}), respectively. We model all four approaches by formal proof systems and show that QCDCLUNI-ANY\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf{QCDCL}^\ extsf {{U\ iny {\\MakeUppercase {ni}}-A\ iny {\\MakeUppercase {ny}}}}$$\\end{document} is exponentially better than QCDCL\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathsf{{QCDCL}} $$\\end{document} on false formulas, whereas QCDCLEXI-ANY\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf{QCDCL}^\ extsf {{E\ iny {\\MakeUppercase {xi}}-A\ iny {\\MakeUppercase {ny}}}}$$\\end{document} is exponentially better than QCDCL\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathsf{{QCDCL}} $$\\end{document} on true QBFs. Technically, this involves constructing specific QBF families and showing lower and upper bounds in the respective proof systems. We complement our theoretical study with some initial experiments that confirm our theoretical findings.

Lepage Equivalents and the Variational Bicomplex

We show how to construct, for a Lagrangian of arbitrary order, a Lepage equivalent satisfying the closure property: that the Lepage equivalent vanishes precisely when the Lagrangian is null. The construction uses a homotopy operator for the horizontal differential of the variational bicomplex. A choice of symmetric linear connection on the manifold of independent variables, and a global homotopy operator constructed using that connection, may then be used to extend any global Lepage equivalent to one satisfying the closure property. In the second part of the paper we investigate the role of vertical endomorphisms in constructing such Lepage equivalents. These endomorphisms may be used directly to construct local homotopy operators. Together with a symmetric linear connection they may also be used to construct global vertical tensors, and these define infinitesimal nonholonomic projections which in turn may be used to construct Lepage equivalents. We conjecture that these global vertical tensors may also be used to define global homotopy operators.

No-signalling constrains quantum computation with indefinite causal structure

Quantum processes with indefinite causal structure emerge when we wonder which are the most general evolutions, allowed by quantum theory, of a set of local systems which are not assumed to be in any particular causal order. These processes can be described within the framework of higher−order quantum theory which, starting from considering maps from quantum transformations to quantum transformations, recursively constructs a hierarchy of quantum maps of increasingly higher order. In this work, we develop a formalism for quantum computation with indefinite causal structures; namely, we characterize the computational structure of higher order quantum maps. Taking an axiomatic approach, the rules of this computation are identified as the most general compositions of higher order maps which are compatible with the mathematical structure of quantum theory. We provide a mathematical characterization of the admissible composition for arbitrary higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems of the higher order quantum maps.

An Exact Expression for Multidimensional Spectroscopy of a Spin‐Boson Hamiltonian

AbstractMultidimensional coherent spectroscopy is a powerful tool to characterize nonlinear optical response functions. Typically, multidimensional spectra are interpreted via a perturbative framework that straightforwardly provides intuition into the density matrix dynamics that give rise to specific spectral features. When the goal is to characterize system coupling to a thermal bath however, the perturbative formalism becomes unwieldy and yields less intuition. Here, an approach developed by Vagov et al. is extended to provide an exact expression for multidimensional spectra of a spin‐boson Hamiltonian up to arbitrary order of electric field interaction. The utility of this expression is demonstrated by modeling polaron formation and coherent exciton‐phonon coupling in quantum dots, which strongly agree with experiment.

Hexahedral finite elements with enhanced fixed‐pole interpolation for linear static and vibration analysis of 3D micropolar continuum

AbstractThe spotlight of this research is on the application of the fixed‐pole interpolation, sometimes used in the analysis of three‐dimensional (3D) geometrically non‐linear beams, but for which no attempts have been made to apply it to linear analysis so far. Particular attention is given to the correlation between the linearised forms of the fixed‐pole and helicoidal interpolation with the linked interpolation. Knowledge of this interdependence is crucial for identifying paths for possible enhancement and extension from the Timoshenko beam of arbitrary order to the new hexahedral finite element of arbitrary order for linear analysis of 3D micropolar continuum. After ensuring the convergence of the newly developed micropolar element through a set of patch tests, three numerical examples of a 3D micropolar continuum in static equilibrium and free vibration of 3D micropolar plates with different geometric properties and boundary conditions have been analysed. Based on these results, the newly proposed finite elements have been critically assessed against the conventional elements.

A parameter-free mixed formulation for the Stokes equations and linear elasticity with strongly symmetric stress

In this paper, we design and analyze a parameter-free mixed method of arbitrary polynomial orders for the Stokes equations and linear elasticity problem, where the symmetry of stress is strongly imposed. Equal-order polynomials are exploited for the stress and velocity spaces in which the stress is approximated by discontinuous polynomials. In contrast, the velocity is approximated by an H(div;Ω) conforming space. As a consequence, the proposed scheme yields divergence-free velocity approximations and is pressure-robust for the Stokes equations. The stable Stokes pair are integrated to facilitate the proof of the inf-sup condition. The comprehensive convergence error estimates for all the variables are explored for the Stokes equations and linear elasticity problem. In particular, we explicitly track the dependence of the error estimates on the physical parameters and illustrate the locking-free property of the proposed scheme, which is non-trivial under the proposed formulation. The judicious balancing of the mixed formulation and the equivalent primal formulation enable us to achieve the robust error estimates for the linear elasticity problem. Several numerical experiments for the Stokes equations and linear elasticity problem are carried out to verify the proposed theories.