Results 91 to 100 of about 4,447 (309)
Complex factorization by Chebysev polynomials
A sequence \((u_n)\) is called \(r\)-periodic if satisfies the recurrence relation \[u_n=a_tu_{n-1}+b_tu_{n-2},\] with \(n \equiv t \pmod r\), for \(n\geq 2\), and given numbers \(a_0,\ldots,a_{r-1},b_0,\ldots,b_{r-1}\), with initial conditions \(u_0\) and \(u_1\).
Sahin, Murat, Tan, Elif, Yilmaz, Semih
openaire +3 more sources
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
Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition [PDF]
In this paper, we present a new multichannel spectral factorization algorithm which can be utilized to calculate the approximate spectral factor of any para-Hermitian polynomial matrix.
Weiss, Stephan +6 more
core +1 more source
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source
Hyperbolic QR factorization for J-spectral factorization of polynomial matrices [PDF]
Motivated by a superfluous zero extraction problem arising in the discrete-time J-spectral factorization of polynomial matrices, we propose an algorithmic solution to hyperbolic QR factorization of a rank deficient constant matrix.
Didier Henrion, Peter Hippe
core
Factorization of large tetra and penta prime numbers on IBM quantum processor
The factorization of large digit integers in polynomial time is a challenging computational task to decipher. The development of Shor’s algorithm sparked a new resolution for solving the factorization problem.
Ritu Dhaulakhandi +2 more
doaj +1 more source
The row first-minus-last right (RFMLR) circulant matrix and row last-minus-first left (RLMFL) circulant matrices are two special pattern matrices. By using the inverse factorization of polynomial, we give the exact formulae of determinants of the two ...
Zhaolin Jiang, Nuo Shen, Juan Li
doaj +1 more source
A Practical Noise2Noise Denoising Pipeline for High‐Throughput Raman Spectroscopy
A lightweight and reproducible denoising pipeline for high‐throughput Raman spectroscopy is introduced, based on a 1D convolutional autoencoder trained with a Noise2Noise strategy. Using only repeated short‐exposure acquisitions, the method suppresses stochastic noise without reference spectra, enabling reliable spectral reconstruction while preserving
David Martin‐Calle +5 more
wiley +1 more source
A factor graph based genetic algorithm
We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem.
Helmi B. Hoda +2 more
doaj +1 more source
Counterion Dependent Side‐Chain Relaxation Stiffens a Chemically Doped Thienothiophene Copolymer
Oxidation of a thienothiophene copolymer, p(g3TT‐T2), via different doping strategies and dopant molecules resulted in materials with similar oxidation levels and a high electrical conductivity of ≈100 S cm−1. However, mechanical properties varied significantly, with sub‐glass transition temperatures and elastic moduli spanning from –44°C to –3°C and ...
Mariavittoria Craighero +12 more
wiley +1 more source

