Results 61 to 70 of about 549,018 (333)
Decomposable matrix polynomials
Linear Algebra and its Applications, 1993 Let \(L(z)=zI-A\), where \(A\) is an \(n\times n\) complex matrix. It is well known that \(\mathbb{C}^ n\) is the sum of subspaces of the form \(X(z_ 0)=\{x\in\mathbb{C}^ n| L(z)^{-1}x\) has singularity only at \(z_ 0\}\), where \(z_ 0\in\sigma(A)\).
Förster, K.-H., Nagy, B.
openaire +1 more source
Advanced Engineering Materials, EarlyView.Stabilization of L‐PBF Ni50.7Ti49.3 under low‐cycle loading was investigated. Recoverable strain after cycling was dependent on the amount of applied load. Recovery ratio was 53.4% and 35.1% at intermediate and high load, respectively. The maximum total strain reached 10.3% at a high load of 1200 MPa.
Ondřej Červinek +5 more
wiley +1 more source
IEEE AccessThis paper presents a scheme that is designed for the effective implementation of lattice reduction for polynomial matrices within the list-decoding algorithm that is applied to the binary Goppa codes.
Ki-Soon Yu, Dae-Woon Lim
doaj +1 more source
Two Variables Shivley’s Matrix Polynomials [PDF]
Symmetry, 2019 The principal object of this paper is to introduce two variable Shivley’s matrix polynomials and derive their special properties. Generating matrix functions, matrix recurrence relations, summation formula and operational representations for these polynomials are deduced.
Fuli He +3 more
openaire +2 more sources
Additive Gaussian Process Regression for Predictive Design of High‐Performance, Printable Silicones
Advanced Engineering Materials, EarlyView.A chemistry‐aware design framework for tuning printable polydimethylsiloxane (PDMS) for vat photopolymerization (VPP) is developed using additive Gaussian process (GP) modeling. Polymer network mechanics informs variable groupings, feasible formulation constraints, and interaction variables.
Roxana Carbonell +3 more
wiley +1 more source
Lossy Compression using Adaptive Polynomial Image Encoding
Advances in Electrical and Computer Engineering, 2021 In this paper, an efficient lossy compression approach using adaptive-block polynomial curve-fitting encoding is proposed. The main idea of polynomial curve fitting is to reduce the number of data elements in an image block to a few coefficients.
OTHMAN, S. +3 more
doaj +1 more source
Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
, 2012 Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in polynomial form rather ...
Bini, Dario A., Noferini, V.
core +1 more source
Advanced Engineering Materials, EarlyView.A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
Kronecker product of matrices and solutions of Sylvestertype matrix polynomial equations
Математичні СтудіїWe investigate the solutions of the Sylvester-type matrix polynomial equation $$A(\lambda)X(\lambda)+Y(\lambda)B(\lambda)=C(\lambda),$$ where\ $A(\lambda),$ \ $ B(\lambda),$\ and \ $C(\lambda)$ are the polynomial matrices with elements in a ring of ...
N. S. Dzhaliuk, V. M. Petrychkovych
doaj +1 more source
ON CAUCHY-TYPE BOUNDS FOR THE EIGENVALUES OF A SPECIAL CLASS OF MATRIX POLYNOMIALS
Ural Mathematical Journal, 2023 Let \(\mathbb{C}^{m\times m}\) be the set of all \(m\times m\) matrices whose entries are in \(\mathbb{C},\) the set of complex numbers. Then \(P(z):=\sum\limits_{j=0}^nA_jz^j,\) \(A_j\in \mathbb{C}^{m\times m},\) \(0\leq j\leq n\) is called a matrix ...
Zahid Bashir Monga, Wali Mohammad Shah
doaj +1 more source