Results 121 to 130 of about 94,123 (313)

Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems [PDF]

We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite ...
Berc Rustem, Panos Parpas, P. M. Kleniati   +2 more
core  

Bernstein form of a polynomial [PDF]

, 1966
Let P denote a polynomial with real coefficients. In this paper we devise an algorithm for determining upper and lower bounds for the set {P(x) : 0
Cargo, G.T.; Shisha, O
core   +1 more source

SPADE: A Deep Learning Framework for Spatial Mapping and Quantitative Cell–Cell Interaction Inference

Advanced Science, EarlyView.
SPADE integrates spatial transcriptomics with single‐cell RNA sequencing by using cell–cell communications (CCC) as a guide for spatial mapping. It improves cell‐type localization, enhances sparse gene‐expression signals, and reveals CCC programs at single‐spot resolution.
Xinyi Li, Ning Zhang, Zijie Jin
wiley   +1 more source

An optimized Lanczos Tau-method

St. Petersburg Polytechnical University Journal: Physics and Mathematics
The paper puts forward an effective algorithm for producing approximate polynomial solutions for linear ordinary differential equations (LODEs) and sets of LODEs with polynomial coefficients and polynomial right-hand side functions.
Bulyanitsa Anton, Berdnikov Alexander, Evstrapov Anatoly   +2 more
doaj   +1 more source

POLYNOMIAL SOLVABILITY OF NP-COMPLETE PROBLEMS

ScienceOpen Research, 2014
A polynomial algorithm for solving the ''Hamiltonian circuit'' problem is presented in the paper. Computational complexity of the algorithm is equal to $O\left(n^8\log_2^2{n}\right)$ where $n$ is the cardinality of the observed graph vertex set. Thus the
Anatoly Panyukov
doaj   +1 more source

An exciting Approach to Theoretical Spectroscopy

Advanced Science, EarlyView.
ABSTRACT Theoretical spectroscopy, and more generally, electronic‐structure theory, are powerful concepts for describing the complex many‐body interactions in materials. They cover methods from ground‐state properties to lattice excitations and light‐matter interaction, including time‐resolved variants.
Martí Raya‐Moreno, Alexander Buccheri, Noah Alexy Dasch, Nasrin Farahani, Ignacio Gonzalez Oliva, Andris Gulans, Seokhyun Hong, Manoar Hossain, Hannah Kleine, Martin Kuban, Sven Lubeck, Benedikt Maurer, Pasquale Pavone, Fabian Peschel, Daria Popova‐Gorelova, Lu Qiao, Elias Richter, Santiago Rigamonti, Ronaldo Rodrigues Pela, Maximilian Schebek, Kshitij Sinha, Daniel T. Speckhard, Jan Stutz, Sebastian Tillack, Dmitry Tumakov, Jānis Užulis, Mara Voiculescu, Cecilia Vona, Mao Yang, Claudia Draxl   +29 more
wiley   +1 more source

Generator polynomial estimation of LFSR sequence based on GFFT

Dianxin kexue, 2018
The problem addressed here is generator polynomial estimation of linear feedback shift register (LFSR) sequence.An algorithm based on the Galois field Fourier transform (GFFT) was proposed.The relationship between non-zero points in GFFT of LFSR sequence
Lihua SHEN
doaj   +2 more sources

A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings

Open Mathematics, 2015
Signature-based algorithms are efficient algorithms for computing Gröbner-Shirshov bases in commutative polynomial rings, and some noncommutative rings. In this paper, we first define skew solvable polynomial rings, which are generalizations of solvable ...
Zhao Xiangui, Zhang Yang
doaj   +1 more source

A polynomial algorithm for best-subset selection problem. [PDF]

Proc Natl Acad Sci U S A, 2020
Zhu J, Wen C, Zhu J, Zhang H, Wang X.
europepmc   +1 more source

Linear and ellipsoidal pattern separation: theoretical aspects and experimental analysis [PDF]

, 2009
This thesis deals with a pattern classification problem, which geometrically implies data separation in some Euclidean feature space. The task is to infer a classifier (a separating surface) from a set or sequence of observations.
Kharechko, Andriy
core