Results 71 to 80 of about 124,064 (205)
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
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
Solving Stochastic Climate‐Economy Models: A Deep Least‐Squares Monte Carlo Approach
ABSTRACT Stochastic versions of recursive integrated climate‐economy assessment models are essential for studying and quantifying policy decisions under uncertainty. However, as the number of state variables and stochastic shocks increases, solving these models via deterministic grid‐based dynamic programming (e.g., value‐function iteration/projection ...
Aleksandar Arandjelović +4 more
wiley +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
An effective Bombieri–Vinogradov error term for sifting problems
Abstract In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for which they hold cannot be computed.
Daniel R. Johnston
wiley +1 more source
Counting on Chebyshev Polynomials [PDF]
Chebyshev polynomials have several elegant combinatorial interpretations. Specificially, the Chebyshev polynomials of the first kind are defined by T0(x) = 1, T1(x) = x, and Tn(x) = 2x Tn-1(x) - Tn-2(x). Chebyshev polynomials of the second kind Un(x) are
Benjamin, Arthur T. +1 more
core +1 more source
The main question addressed in this study is whether a newly constructed orthogonal basis, which is a combination of first- and second-kind Chebyshev polynomials, can provide a more accurate and efficient numerical method for solving fractional integro ...
Samiye Akhlaghi +2 more
doaj +1 more source
ABSTRACT Preparing quantum states with desired amplitude distributions is a key bottleneck in the implementation of quantum linear and nonlinear dynamics solvers, including Linear Combination of Hamiltonian Simulation (LCHS) and Schrödingerization. We present a direct, closed‐form construction of Quantized Tensor Train (QTT) representations for two ...
Katsuhiro Endo, Kazuaki Z. Takahashi
wiley +1 more source
Generalized Chebyshev polynomials [PDF]
-We generalize the first and second kind Chebyshev polynomials by using the concepts and the operational formalism of the Hermite polynomials of the Kampé de Fériet type.
Clemente Cesarano
core
The Faber polynomials for annular sectors and an application to the iterative solution of linear systems of equations [PDF]
A conformal mapping of the exterior of the unit circle to the exterior of a region of the complex plane determines the Faber polynomials for that region.
Myers, Nicholas John, Myers, N.J
core

