Results 61 to 70 of about 378,739 (288)
Fermi Surface Nesting and Anomalous Hall Effect in Magnetically Frustrated Mn2PdIn
Advanced Functional Materials, EarlyView.Mn2PdIn, a frustrated inverse Heusler alloy, showing electronic‐structure driven anomalous Hall effect with Weyl crossings, Fermi‐surface nesting and near‐zero magnetization ideal for low‐magnetization spintronics. Abstract Noncollinear magnets with near‐zero net magnetization and nontrivial bulk electronic topology hold significant promise for ...
Afsar Ahmed +7 more
wiley +1 more source
Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2011 In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented.
Mohamed Achache, Naima Boudiaf
doaj +2 more sources
Matrix cyclization over complex polynomials
Linear Algebra and its Applications, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The complex zeros of random polynomials [PDF]
Transactions of the American Mathematical Society, 1995 Mark Kac gave an explicit formula for the expectation of the number, ν n ( Ω ) {\nu _n}(\Omega ) , of zeros of a random polynomial, \[ P n ( z ) = ∑
Shepp, Larry A, Vanderbei, Robert J
openaire +3 more sources
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
Advanced Functional Materials, EarlyView.A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore +7 more
wiley +1 more source
پژوهشهای ریاضی, 2021 By using a new search direction, we propose an infeasible interior-point method for monotone linear complementarity problem. The algorithm uses only one feasibility step in each iteration, and we prove that it suffices in order to obtain a polynomial ...
Nezameddin Mahdavi-Amiri +1 more
doaj
On computational complexity of Siegel Julia sets
, 2005 It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification.
Binder, I., Braverman, M., Yampolsky, M.
core +1 more source
Advanced Functional Materials, EarlyView.In this study, the preparation techniques for silver‐based gas diffusion electrodes used for the electrochemical reduction of carbon dioxide (eCO2R) are systematically reviewed and compared with respect to their scalability. In addition, physics‐based and data‐driven modeling approaches are discussed, and a perspective is given on how modeling can aid ...
Simon Emken +6 more
wiley +1 more source
Известия Иркутского государственного университета: Серия "Математика", 2016 Recently, the interest to polynomial representations of functions over finite fields and over finite rings is being increased. Complexity of those representations is widely studied.
A. Kazimirov, S. Reymerov
doaj
Chebyshev Polynomials and Generalized Complex Numbers [PDF]
Advances in Applied Clifford Algebras, 2013 The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of matrices and to trigonometric functions, we take the quite natural step to discuss them in the context of the theory ...
Babusci, D. +3 more
openaire +3 more sources