Works Published in 2023
Displaying works 161 - 166 of 166 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2023 journal article
Local characteristic decomposition based central-upwind scheme
JOURNAL OF COMPUTATIONAL PHYSICS, 473.
author keywords: Local characteristic decomposition; Central-upwind schemes; Hyperbolic systems of conservative laws; Euler equations of gas dynamics
arxiv.org (repository)
Sources: Web Of Science, NC State University Libraries
Added: November 21, 2022
2023 journal article
On mixing behavior of a family of random walks determined by a linear recurrence
DISCRETE MATHEMATICS, 346(1).
author keywords: Random walk; Mixing time; Linear recurrence
Source: Web Of Science
Added: October 31, 2022
2023 journal article
Smooth points on semi-algebraic sets
JOURNAL OF SYMBOLIC COMPUTATION, 116, 183–212.
author keywords: Computational real algebraic geometry; Real smooth points; Real dimension; Polar varieties; Numerical algebraic geometry; Kuramoto model
TL;DR:
A simple procedure based on computing the critical points of some well-chosen function that guarantees the computation of smooth points in each connected bounded component of a real atomic semi-algebraic set is presented.
(via Semantic Scholar)
Source: Web Of Science
Added: October 31, 2022
2023 journal article
A certified iterative method for isolated singular roots
JOURNAL OF SYMBOLIC COMPUTATION, 115, 223–247.
author keywords: Polynomial equations; Isolated solution; Multiple root; Certification; Newton iteration; Deflation
Sources: Web Of Science, NC State University Libraries
Added: October 3, 2022
2023 journal article
Numerical analysis of a free boundary problem with non-local obstacles
APPLIED MATHEMATICS LETTERS, 135.
author keywords: Obstacle-like minimization problem; Free boundary; SOR(omega) iteration
Sources: ORCID, Web Of Science, NC State University Libraries
Added: August 30, 2022
2023 journal article
Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
JOURNAL OF SYMBOLIC COMPUTATION, 114, 246–266.
author keywords: Polynomial optimization; Nonnegativity certificates; Circuit polynomials; Convex optimization; Duality; Power cone
TL;DR:
The proof, based on convex programming duality, removes the nondegeneracy assumption and motivates an algorithm that generates an optimal set of circuits and computes the corresponding SONC bound in a manner that is particularly attractive for sparse polynomials.
(via Semantic Scholar)
Source: Web Of Science
Added: June 13, 2022
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
