Results 11 to 20 of about 30,179 (295)
Wijsman quasi-invariant convergence [PDF]
In this study, we defined concepts of Wijsman quasi-invariant convergence, Wijsman quasi-strongly invariant convergence and Wijsman quasi-strongly q-invariant convergence. Also, we give the concept of Wijsman quasi-invariant statistically convergence. Then, we study relationships among these concepts.
Gülle, Esra, Ulusu, Uğur
openaire +4 more sources
The rate of convergence of real invariant subspaces
Let \(M\) and \(N\) be invariant subspaces of the real square matrices \(A\) and \(B\) respectively. This paper discusses the rate of convergence of \(N\rightarrow M\) as \(B\rightarrow A\). This is expressed by the notion of \(\alpha\)-stability. More precisely, let \(P_ M\) and \(P_ N\) be the projectors on \(M\) and \(N\) respectively, then the \(A\)
Ran, AndréC.M., Rodman, Leiba
openaire +3 more sources
Affine processes: invariant measures and convergence
Affine processes have been of great interest to researchers and financial practitioners for many years due to their flexibility and the analytic tractability of the models incorporating them. The canonical setting expounded by Duffie, Filipović, and Schachermayer (2003) provides a rich theoretical framework in which to develop practical applications ...
Glass, Timothy
openaire +4 more sources
Lupaş post quantum Bernstein operators over arbitrary compact intervals
This paper deals with Lupaş post quantum Bernstein operators over arbitrary closed and bounded interval constructed with the help of Lupaş post quantum Bernstein bases.
A. Khan +3 more
doaj +1 more source
Convergence of Restarted Krylov Subspaces to Invariant Subspaces [PDF]
The authors prove estimates for the angle (strictly spoken: for the containment gap) between a searched invariant subspace of a general \(n\times n\) matrix and the subspace generated by Krylov subspace methods like the Arnoldi algorithm or the biorthogonal Lanczos algorithm.
Christopher Beattie +2 more
openaire +1 more source
Asymptotically J_σ-Equivalence of Sequences of Sets
In thisstudy, we introduce the concepts of Wijsman asymptotically J-invariant equivalence (WLJσ) ,Wijsman asymptotically strongly p-invariant equivalence([WLVσ)]p) and Wijsman asymptotically J*-invariant equivalence(WLJ*σ).
Uğur Ulusu, Esra Gülle
doaj +1 more source
Cubically Convergent Iterations for Invariant Subspace Computation [PDF]
Summary: We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of \(\mathbb R^n\) and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence ...
Pierre-Antoine Absil +3 more
openaire +2 more sources
Algorithms for computing normally hyperbolic invariant manifolds [PDF]
An effcient algorithm is developed for the numerical computation of normally hyperbolic invariant manifolds, based on the graph transform and Newton's method.
Vegter, G., +10 more
core +1 more source
On the Solutions of a Fourth Order Difference Equation
In this paper, we solve and study the global behavior of the well defined solutions of the difference equation $$x_{n+1}=\frac{x_{n}x_{n-3}}{Ax_{n-2}+Bx_{n-3}}, \quad n=0,1,...,$$ where $A, B>0$ and the initial values $x_{-i}$, $i\in\{0,1,2,3 ...
R Abo-zeıd
doaj +1 more source
Complete convergence of randomly weighted END sequences and its application
We investigate the complete convergence of partial sums of randomly weighted extended negatively dependent (END) random variables. Some results of complete moment convergence, complete convergence and the strong law of large numbers for this dependent ...
Penghua Li, Xiaoqin Li, Kehan Wu
doaj +1 more source

