Works Published in 2003
Displaying works 21 - 40 of 130 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2003 report
Artificial Boundary Conditions for the Numerical Simulation of Unsteady Electromagnetic Waves
(No. CRSC–TR03–19). https://stsynkov.math.ncsu.edu/publications/a34p.ncsu.pdf
Event: at Raleigh, NC
Source: ORCID
Added: September 6, 2019
2003 chapter
Lacunae-Based Artificial Boundary Conditions for the Numerical Simulation of Unsteady Waves Governed by Vector Models
In G. C. Cohen, E. Heikkola, P. Joly, & P. Neittaanmäki (Eds.), Mathematical and Numerical Aspects of Wave Propagation --- WAVES 2003, The Sixth International Conference, Jyväskylä, Finland, June 30 -- July 4, 2003. Proceedings (pp. 103–108). https://stsynkov.math.ncsu.edu/publications/waves2003p.pdf
Ed(s): G. Cohen, E. Heikkola, P. Joly & P. Neittaanmäki
Event: at Berlin
Source: ORCID
Added: September 6, 2019
2003 conference paper
Numerical Tools for the Study of Instabilities within the Positive-Differential-Resistance Regions of Tunnelling Devices
Proceedings of 2003 3nd IEEE Conference on Nanotechnology, San Francisco, CA, August 12--14, 2003, (CRSC-TR03-23), 390–393. IEEE.
Event: North Carolina State University, Center for Research in Scientific Computation
Source: ORCID
Added: August 29, 2019
2003 book
Solving Nonlinear Equations with Newton's Method
Philadelphia: SIAM.
Event: at Philadelphia
Source: ORCID
Added: August 29, 2019
2003 journal article
Globally Convergent Algorithms for Nonsmooth Nonlinear Equations in Computational Fluid Dynamics
J. Comp. Appl. Math., 152, 69–81.
Source: ORCID
Added: August 29, 2019
2003 conference paper
Implicit filtering and nonlinear least squares problems
In E. W. Sachs & R. Tichatschke (Eds.), System Modeling and Optimization XX (pp. 71–90). Dordrecht: Kluwer Academic Publishers.
Ed(s): E. Sachs & R. Tichatschke
Event: at Dordrecht
Source: ORCID
Added: August 29, 2019
2003 report
Implicit filtering and nonlinear least squares problems
In E. W. Sachs & R. Tichatschke (Eds.), System Modeling and Optimization XX (No. CRSC-TR01-17; pp. 71–90). Dordrecht: Kluwer Academic Publishers.
Ed(s): E. Sachs & R. Tichatschke
Event: at Dordrecht
Source: ORCID
Added: August 29, 2019
2003 article
Electronic Supplement to ``{O}ptimal Design for Problems Involving Flow and Transport Phenomena in Saturated Subsurface Systems''
Source: ORCID
Added: August 29, 2019
2003 journal article
Iterating Bregman Retractions
SIAM Journal on Optimization, 13(4), 1159–1173.
author keywords: backward Bregman projection; Bregman distance; Bregman function; Bregman projection; Bregman retraction; convex feasibility problem; forward Bregman projection; Legendre function; paracontraction; projection algorithm
TL;DR:
The main result on iterating Bregman retractions unifies several convergence results on projection methods for solving convex feasibility problems.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 28, 2019
2003 journal article
Hybrid projection–reflection method for phase retrieval
Journal of the Optical Society of America A, 20(6), 1025.
TL;DR:
A new projection-based method, termed the hybrid projection-reflection (HPR) algorithm, is introduced for solving phase-retrieval problems featuring nonnegativity constraints in the object domain, motivated by properties of the HPR algorithm for convex constraints.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 28, 2019
2003 journal article
Bregman Monotone Optimization Algorithms
SIAM Journal on Control and Optimization, 42(2), 596–636.
author keywords: Banach space; block-iterative method; Bregman distance; Bregman monotone; Bregman projection; B-class operator; convex feasibility problem; essentially smooth function; essentially strict convex function; Fejer monotone; Legendre function; monotone operator; proximal mapping; proximal point algorithm; resolvent; subgradient projection
TL;DR:
A systematic investigation of the notion of Bregman monotonicity leads to a simplified analysis of numerous algorithms and to the development of a new class of parallel block-iterative surrogate BRegman projection schemes.
(via Semantic Scholar)
epubs.siam.org (publisher PDF)
Sources: Crossref, NC State University Libraries
Added: July 28, 2019
2003 journal article
A block-iterative surrogate constraint splitting method for quadratic signal recovery
IEEE Transactions on Signal Processing, 51(7), 1771–1782.
author keywords: block-iterative optimization; convex analysis; deconvolution; quadratic programming; signal recovery; subgradient projection
TL;DR:
A block-iterative parallel decomposition method is proposed to solve general quadratic signal recovery problems under convex constraints by local linearizations of blocks of constraints, and it is therefore not sensitive to their analytical complexity.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: July 28, 2019
2003 journal article
Construction of best Bregman approximations in reflexive Banach spaces
Proceedings of the American Mathematical Society, 131(12), 3757–3766.
author keywords: best approximation; Bregman distance; decomposition; Haugazeau
Sources: Crossref, NC State University Libraries
Added: July 28, 2019
2003 journal article
Invariant Euler-Lagrange equations and the invariant variational bicomplex
Acta Applicandae Mathematicae, 76(2), 137–193.
Contributors: I. Kogan* & P. Olver *
author keywords: calculus of variations; Lie group; moving frame; differential invariant; Euler-Lagrange equation; variational bicomplex
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(OpenAlex)
Sources: ORCID, NC State University Libraries, NC State University Libraries
Added: July 28, 2019
2003 journal article
International Mathematics Research Notices, 2003(3), 123.
Source: Crossref
Added: July 28, 2019
2003 journal article
Two Algorithms for a Moving Frame Construction
Canadian Journal of Mathematics, 55(2), 266–291.
Contributors: I. Kogan*
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(OpenAlex)
Sources: Crossref, NC State University Libraries, ORCID
Added: July 20, 2019
2003 journal article
Auxiliary signal design for robust active failure detection: the general cost case
Proc. Safeprocess 2003, 259–264.
Source: NC State University Libraries
Added: July 11, 2019
2003 journal article
Lexicographic Shellability for Balanced Complexes
Journal of Algebraic Combinatorics, 17(3), 225–254.
author keywords: shellability; Boolean cell complex; simplicial poset; partition lattice; wreath product
Source: Crossref
Added: July 10, 2019
2003 journal article
The order dimension of the poset of regions in a hyperplane arrangement
Journal of Combinatorial Theory, Series A, 104(2), 265–285.
Contributors: N. Reading*
TL;DR:
It is shown that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter Group, and bounds on the order dimensions for the other finite types are given.
(via Semantic Scholar)
Sources: Crossref, ORCID, NC State University Libraries
Added: July 1, 2019
2003 journal article
Lattice and order properties of the poset of regions in a hyperplane arrangement
Algebra Universalis, 50(2), 179–205.
Contributors: N. Reading*
author keywords: bounded lattice; Cayley lattice; congruence normal; congruence uniform; Coxeter group; critical pair; doubling; hyperplane arrangement; order dimension; order quotient; permutation lattice; poset of regions; semi-distributive lattice; simplicial; subcritical pair; supersolvable; weak order
Sources: Crossref, ORCID, NC State University Libraries
Added: July 1, 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.
