Results 61 to 70 of about 1,869 (181)
ABSTRACT Fluid‐filled phase‐field fracture simulations require robust, scalable solvers that can handle strongly nonlinear, non‐smooth mechanics and tightly coupled flow on locally refined meshes. In this work, we develop an adaptive finite element framework for quasi‐static, fluid‐filled phase‐field fractures that combines semi‐smooth Newton methods ...
Leon M. Kolditz +3 more
wiley +1 more source
Complex Factorizations of the Lucas Sequences via Matrix Methods
Firstly, we show a connection between the first Lucas sequence and the determinants of some tridiagonal matrices. Secondly, we derive the complex factorizations of the first Lucas sequence by computing those determinants with the help of Chebyshev ...
Honglin Wu
doaj +1 more source
Chebyshev polynomials and their some interesting applications
The main purpose of this paper is by using the definitions and properties of Chebyshev polynomials to study the power sum problems involving Fibonacci polynomials and Lucas polynomials and to obtain some interesting divisible properties.
Chen Li, Zhang Wenpeng
doaj +1 more source
Self‐Similar Blowup for the Cubic Schrödinger Equation
ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
Determinants of Tridiagonal and Circulant Matrices Special Form by Chebyshev Polynomials
Along with the development of science, many researchers have found new methods to determine the determinant of a matrix of more than three orders.
Nurliantika Nurliantika +2 more
doaj +1 more source
ABSTRACT We derive eigenvalue bounds for symmetric block‐tridiagonal multiple saddle‐point systems preconditioned with block‐diagonal Schur complement matrices. This analysis applies to an arbitrary number of blocks and accounts for the case where the Schur complements are approximated, generalizing the findings in [11, Bergamaschi et al., Linear ...
Marco Pilotto +2 more
wiley +1 more source
Representing derivatives of Chebyshev polynomials by Chebyshev polynomials
A recursion formula for derivatives of Chebyshev polynomials is replaced by an explicit formula.
openaire +2 more sources
ABSTRACT We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski (2004). Vertices are attached sequentially, one by one, by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random.
Louigi Addario‐Berry +5 more
wiley +1 more source
Miners' Reward Elasticity and Stability of Competing Proof‐of‐Work Cryptocurrencies
ABSTRACT Proof‐of‐Work cryptocurrencies employ miners to sustain the system through algorithmic reward adjustments. We develop a stochastic model of the multicurrency mining and identify conditions for stable transaction speeds. Bitcoin's algorithm requires hash supply elasticity <$<$1 for stability, while ASERT remains stable for any elasticity and ...
Kohei Kawaguchi +2 more
wiley +1 more source
This paper presents two operational matrices. The first one represents integer-order derivatives of the modified shifted Chebyshev polynomials of the second kind.
M. Abdelhakem +3 more
doaj +1 more source

