Results 81 to 90 of about 331 (256)
Oscillation Criteria for Matrix Hamiltonian Systems via the Summability Method
By using the summability method and Riccati transformation, the author studies the oscillation of the following linear matrix Hamiltonian system \[ \begin{cases} X'=A(t)X+B(t)U,\\ U'=C(t)X-A^{*}(t)U, \;t\geq0. \end{cases} \] Some new oscillation criteria are established, which improve and generalize some known results of \textit{G. J. Butler, H.
openaire +2 more sources
On the study of double Fourier series by double matrix summability method
In this paper a new theorem on double matrix summability of double Fourier series has been established. This theorem is a generalization of several known and unknown results.
Lal, Shyam, Tripathi, Virendra Nath
openaire +3 more sources
ORDINARY, ABSOLUTE AND STRONG SUMMABILITY AND MATRIX TRANSFORMATIONS
. Many important sequence spaces arise in a natural way from various concepts of summability, namely ordinary, absolute and strong summability. In the first two cases they may be considered as the domains of the matrices that define the respective ...
Abdullah M. Jarrah, Eberhard Malkowsky
core
Phase‐field simulations coupled with dislocation‐density‐based crystal plasticity modeling reproduce γ′ rafting behavior in single‐crystal Ni‐based superalloys under varied loading conditions. The model captures both macroscopic creep and microscopic morphology evolution, with results matching high‐temperature creep experiments.
Micheal Younan +5 more
wiley +1 more source
Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading
The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley +1 more source
The effects of matrix summability methodson bounds of function sequences
Let \(A\) be an infinite matrix, \(\mathcal{F}\) a space of function sequences, \(A\mathcal{F} := \sum_{k = 1}^{\infty}a_{nk}f_k(x)\). The symbol \(G(\mathcal{F}; D)\) denotes the least upper bound of the element \(f_n(x)\) over the subset \(D\). \textit{R. P. Agnew} [Trans. Am. Math. Soc.
openaire +1 more source
Multimodal Data‐Driven Microstructure Characterization
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Matrix Transforms of Summability Domains of Zweier Method
Let Z1/2 be the Zweier method, and B and M matrices with real or complex entries. In the present paper, we find necessary and sufficient conditions for M to be transform from the summability domain of Z1/2 into the summability domain of B if B is lower triangular. For an infinite matrix B, we consider only sufficient conditions.
openaire +1 more source
Matrix Transformations Based on Dirichlet Convolution
This paper is a study of summability methods that are based on Dirichlet convolution. If f(n) is a function on positive integers and x is a sequence such that then x is said to be Af-summable to L.
Suguna Selvaraj, Chikkanna Selvaraj
core +1 more source

