Works Published in 1998
Displaying works 1 - 20 of 142 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
1998 journal article
Orthomax Rotation Problem. A Differential Equation Approach
Behaviormetrika, 25(1), 13–23.
Contributors: M. Chu n & N. Trendafilov*
oro.open.ac.uk (repository)
Sources: ORCID, Crossref, NC State University Libraries
Added: July 4, 2023
1998 conference paper
Approximation by structured lower rank matrices
Proceedings of SPIE - The International Society for Optical Engineering, 3461, 268–279.
Contributors: M. Chu n , R. Funderlic n & R. Plemmons *
TL;DR:
The techniques developed in this paper can easily be implemented for numerical computation and it is shown that the computations can be approached using efficient optimization packages.
(via Semantic Scholar)
Source: ORCID
Added: July 4, 2023
1998 book
A mechanical theory of in vitro vascular network formation
In Cardiovascular Molecular Morphogenesis Series; Vascular morphogenesis: In vivo, in vitro, in mente (pp. 173–188). http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=ORCID&SrcApp=OrcidOrg&DestLinkType=FullRecord&DestApp=BIOSIS&KeyUT=BIOSIS:PREV199900155952&KeyUID=BIOSIS:PREV199900155952
Contributors: J. Murray, D. Manoussaki, S. Lubkin , R. Vernon, C. Little, V. Mironov, E. Sage
Source: ORCID
Added: August 23, 2021
1998 report
If a matrix has a single eigenvalue, how sensitive is this eigenvalue?
(Technical Report No. CRSC-TR98-8). Raleigh, NC: Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University.
Source: NC State University Libraries
Added: March 24, 2021
1998 report
A note on the field of values of non-normal matrices
(Technical Report No. CRSC-TR98-26). Raleigh, NC: Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University.
Source: NC State University Libraries
Added: March 24, 2021
1998 report
A different approach to bounding the minimal residual norm in Krylov methods
(Technical Report No. CRSC-TR98-19). Raleigh, NC: Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University.
Source: NC State University Libraries
Added: March 24, 2021
1998 journal article
Theoretical and numerical analysis on a thermo-elastic system with discontinuities
Journal of Computational and Applied Mathematics, 92(1), 37–58.
author keywords: mixed type system; discontinuous coefficients; Dirac delta function; finite difference; semi-implicit prediction-correction scheme; error analysis
Sources: Crossref, NC State University Libraries
Added: March 21, 2021
1998 journal article
Highest weight modules over the W_(1+∞) algebra and the bispectral problem
Duke Mathematical Journal, 93(1), 41–72.
Source: Crossref
Added: January 24, 2021
1998 chapter
Algebraic Algorithms
In Algorithms and Theory of Computation Handbook.
TL;DR:
This is a preliminary version of a Chapter on Algebraic Algorithms in the upcoming Computing Handbook Set Computer Science (Volume I), CRC Press/Taylor and Francis Group.
(via Semantic Scholar)
Source: Crossref
Added: January 21, 2021
1998 journal article
Bounds for Absolute Positiveness of Multivariate Polynomials
J. Symb. Comput., 25(5), 571–585.
TL;DR:
A simple formula for computing bounds for the absolute positiveness of P, a multivariate polynomial with real coefficients, is provided and it is proved that the resulting bounds are guaranteed to be close to the optimal ones.
(via Semantic Scholar)
Source: ORCID
Added: November 6, 2020
1998 conference paper
Computation of Variant Resultants
In B. F. Caviness & J. R. Johnson (Eds.), Quantifier Elimination and Cylindrical Algebraic Decomposition (pp. 327–340). Vienna: Springer Vienna.
Ed(s): B. Caviness & J. Johnson
Event: at Vienna
Source: ORCID
Added: November 6, 2020
1998 journal article
Testing Positiveness of Polynomials
Journal of Automated Reasoning, 21(1), 23–38.
author keywords: positiveness of polynomials; termination proofs; term rewrite systems
TL;DR:
This paper exactly determines how partial several partial methods in the field of term rewriting systems are, and proposes simpler and/or more efficient methods with the same power.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: ORCID
Added: November 6, 2020
1998 journal article
Groebner Basis Under Composition I
Journal of Symbolic Computation, 25(5), 643–663.
TL;DR:
It is proved that this happens iff the composition is compatible with the term ordering and the nondivisibility of Groebner basis computation.
(via Semantic Scholar)
Source: ORCID
Added: November 6, 2020
1998 journal article
Editorial
Mathematics and Computers in Simulation.
Source: ORCID
Added: November 6, 2020
1998 chapter
An Improvement of the Projection Operator in Cylindrical Algebraic Decomposition
In Texts and Monographs in Symbolic Computation (pp. 166–173).
Source: ORCID
Added: November 6, 2020
1998 journal article
Algorithms for Trigonometric Curves (Simplification, Implicitization, Parameterization)
Journal of Symbolic Computation, 26(3), 279–300.
TL;DR:
Algorithms for (a) simplifying a given parametric representation, (b) computing an implicit representation from a givenparametrically by a truncated Fourier series, and (c) computing a parametric representations from aGiven implicit representation are given.
(via Semantic Scholar)
Source: ORCID
Added: November 6, 2020
1998 conference paper
Constrained pulse shape synthesis for digital communications
Proceedings of the European Signal Processing Conference, 573–576.
Event: Proceedings of the European Signal Processing Conference at Island of Rhodes, Greece on September 8-11, 1998
Source: NC State University Libraries
Added: September 8, 2020
1998 conference paper
FOXBOX
Proceedings of the 1998 international symposium on Symbolic and algebraic computation - ISSAC '98. Presented at the the 1998 international symposium.
Event: the 1998 international symposium
TL;DR:
A software package that puts in practice the black box representation of symbolic objects and provides algorithms for performing the symbolic calculus with such representations is introduced and the results of several challenge problems are presented, representing the first symbolic solutions of such problems.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1998 conference paper
Efficient algorithms for computing the nearest polynomial with constrained roots
Proceedings of the 1998 international symposium on Symbolic and algebraic computation - ISSAC '98. Presented at the the 1998 international symposium.
Event: the 1998 international symposium
TL;DR:
This work gives a polynomial-time algorithm to compute the radius of stability in the Euclidean norm for a variety of stability domains and develops hybrid symbolic-numeric algorithms to constrain one root of a complex or realPolynomial to a curve in the complex plane.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1998 chapter
On the Combined Implementation of Global Boundary Conditions with Central Difference Multigrid Flow Solvers
In T. L. Geers (Ed.), Fluid Mechanics and Its Applications (Vol. 49, pp. 285–294).
Ed(s): T. Geers
Event: at Dordrecht
TL;DR:
The key idea behind the multigrid methodology is that the short-wave components of the error expansion on the grid decay faster than the long-wave ones and therefore, the problem should be considered on a sequence of grids so that for any wave there be a grid, on which this wave can be regarded as short.
(via Semantic Scholar)
Sources: ORCID, Crossref, NC State University Libraries
Added: September 6, 2019
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.
