Results 61 to 70 of about 6,569 (263)
Computation of Minimal Polynomials and Multivector Inverses in Non-Degenerate Clifford Algebras
MathematicsClifford algebras are an active area of mathematical research having numerous applications in mathematical physics and computer graphics, among many others.
Dimiter Prodanov
doaj +1 more source
Finding exact minimal polynomial by approximations
Proceedings of the 2009 conference on Symbolic numeric computation, 2009 We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on obtaining an exact rational number from its approximation.
Xiaolin Qin +3 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
A Computational Model for q-Bernstein Quasi-Minimal Bézier Surface
Journal of Mathematics, 2022 A computational model is presented to find the q-Bernstein quasi-minimal Bézier surfaces as the extremal of Dirichlet functional, and the Bézier surfaces are used quite frequently in the literature of computer science for computer graphics and the ...
Daud Ahmad +5 more
doaj +1 more source
A Practical Noise2Noise Denoising Pipeline for High‐Throughput Raman Spectroscopy
Advanced Engineering Materials, EarlyView.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
Minimizer Extraction in Polynomial Optimization Is Robust
SIAM Journal on Optimization, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Igor Klep, Janez Povh, Jurij Volcic
openaire +4 more sources
Advanced Engineering Materials, EarlyView.Postbuild annealing systematically modifies the phase fractions and morphology of EB‐PBF processed Mo–9Si–8B. Quantitative microstructure–property correlations reveal how controlled phase evolution enhances high‐temperature compressive strength and creep resistance.
Christopher Schmidt +5 more
wiley +1 more source
Al-Mustansiriyah Journal of ScienceBackground: In many studies, spectral methods based on one of the orthogonal polynomials and weighted residual methods (WRMs) have been used to convert the variable-order fractional differential equation (VO-FDEs) into a system of linear or nonlinear ...
Abdulrazzaq T. Abed +1 more
doaj +1 more source
Short certificates for chromatic equivalence
Journal of Graph Algorithms and Applications, 2019 The chromatic polynomial gives the number of proper colourings of a graph in terms of the number of available colours. In general, calculating chromatic polynomials is #P-hard.
Zoe Bukovac, Graham Farr, Kerri Morgan
doaj +1 more source
On the Minimal Polynomial of a Vector
Advances in Linear Algebra & Matrix Theory, 2012 It is well known that the Cayley-Hamilton theorem is an interesting and important theorem in linear algebras, which was first explicitly stated by A. Cayley and W. R. Hamilton about in 1858, but the first general proof was published in 1878 by G. Frobenius, and numerous others have appeared since then, for example see [1,2].
Dabin Zheng, Heguo Liu
openaire +1 more source