TY - CONF
TI - A Survey of Production Planning and Scheduling in the Semiconductor Industry
AU - Uzsoy, R.
AU - Lee, C.Y.
AU - Martin-Vega, L.A.
T2 - TIMS/ORSA Joint National Meeting
C2 - 1991/5//
CY - Nashville, TN
DA - 1991/5//
PY - 1991/5//
ER -
TY - CONF
TI - Scheduling Parallel Semiconductor Test Systems
AU - Uzsoy, R.
AU - Lee, C.Y.
AU - Ovacik, I.
T2 - TIMS/ORSA Joint National Conference
C2 - 1991/5//
CY - Nashville, TN
DA - 1991/5//
PY - 1991/5//
ER -
TY - CONF
TI - An Approximation Methodology for Scheduling Semiconductor Testing Operations
AU - Ovacik, I.
AU - Piercefield, S.A.
AU - Uzsoy, R.
T2 - ORSA/TIMS Joint National Meeting
C2 - 1991/11//
CY - Anaheim, CA
DA - 1991/11//
PY - 1991/11//
ER -
TY - CONF
TI - Scheduling and Order Release in a Make-to-Order Shop
AU - Uzsoy, R.
AU - Ashby, J.R.
AU - Kamin, P.
AU - Wilson, J.R.
T2 - Production and Operations Management Society National Meeting
C2 - 1991/11//
CY - New York
DA - 1991/11//
PY - 1991/11//
ER -
TY - CONF
TI - Sequencing in Large Flowshops to Minimize Completion Time
AU - Traub, R.
AU - Chand, S.
AU - Uzsoy, R.
T2 - ORSA/TIMS Joint National Meeting
C2 - 1991/11//
CY - Anaheim, CA
DA - 1991/11//
PY - 1991/11//
ER -
TY - SOUND
TI - A Scheduling System Architecture for Semiconductor Testing Facilities
AU - Uzsoy, R.
DA - 1991/9//
PY - 1991/9//
ER -
TY - SOUND
TI - A Scheduling System Architecture for Semiconductor Testing Facilities
AU - Uzsoy, R.
DA - 1991/10//
PY - 1991/10//
ER -
TY - JOUR
TI - Production scheduling algorithms for a semiconductor test facility
AU - Uzsoy, R.
AU - Martin-Vega, L.A.
AU - Lee, C.-Y.
AU - Leonard, P.A.
T2 - IEEE Transactions on Semiconductor Manufacturing
AB - The authors develop production scheduling algorithms for semiconductor test operations. The operations in the facility under study are characterized by a broad product mix, variable lot sizes and yields, long and variable setup times, and limited test equipment capacity. The approach presented starts by dividing the facility or job shop into a number of work centers. The method then proceeds to sequence one work center at a time. A disjunctive graph representation of the entire facility is used to capture interactions between work centers. The introduction of different management objectives leads to different work center problems and different production scheduling algorithms. The authors present algorithms for two different work center problems. Direction for future research are discussed.< >
DA - 1991///
PY - 1991///
DO - 10.1109/66.97809
VL - 4
IS - 4
SP - 270-280
J2 - IEEE Trans. Semicond. Manufact.
OP -
SN - 0894-6507
UR - http://dx.doi.org/10.1109/66.97809
DB - Crossref
ER -
TY - JOUR
TI - An experimental expert system for process planning of sheet-metal parts
AU - Uzsoy, Reha
AU - Ramcharan, David J.
AU - Martin-Vega, Louis A.
T2 - Computers & Industrial Engineering
AB - This paper presents an experimental expert system for process planning of sheet-metal parts. A basic framework for representing the necessary expert knowledge and part geometry information is outlined. The system, which is developed in Turbo Prolog and implemented for the planning of simple bent and punched parts, is described. Directions for further research are also examined.
DA - 1991/1//
PY - 1991/1//
DO - 10.1016/0360-8352(91)90040-d
VL - 20
IS - 1
SP - 59-69
J2 - Computers & Industrial Engineering
LA - en
OP -
SN - 0360-8352
UR - http://dx.doi.org/10.1016/0360-8352(91)90040-d
DB - Crossref
ER -
TY - JOUR
TI - Development of a production planning system: A case study
AU - Hodgson, T.J.
AU - King, R.E.
AU - King, C.U.
T2 - Production and Inventory Management
DA - 1991///
PY - 1991///
VL - 1
IS - 4
SP - 18–24
ER -
TY - CONF
TI - Least squares completions for nonlinear index three Hessenberg DAEs
AU - Campbell, Stephen L.
T2 - International Association for Mathematics and Computers in Simulation World Congress on Computation and Applied Mathematics
C2 - 1991///
C3 - IMACS '91 : proceedings of the 13th IMACS World Congress on Computation and Applied Mathematics : July 22-26, 1991, Trinity College, Dublin, Ireland
CY - Dublin, Ireland
DA - 1991///
PY - 1991/7/22/
SP - 1145–1148
PB - Criterion
ER -
TY - CONF
TI - 2-D (differential-delay) implicit systems
AU - Campbell, Stephen L.
T2 - International Association for Mathematics and Computers in Simulation World Congress on Computation and Applied Mathematics
C2 - 1991///
C3 - IMACS '91 : proceedings of the 13th IMACS World Congress on Computation and Applied Mathematics : July 22-26, 1991, Trinity College, Dublin, Ireland
CY - Dublin, Ireland
DA - 1991///
PY - 1991/7/22/
SP - 1828–1829
PB - Criterion Press
ER -
TY - CONF
TI - Promising New Interior-Point Methods for Large Scale Linear Programming
AU - Peterson, E.L
AU - Fang, S.
C2 - 1991///
C3 - Proceedings of Advances in Mathematics, Computations, and Reactor Physics
DA - 1991///
VL - 17
SP - 2.1 – 2.12
M1 - 2
ER -
TY - CONF
TI - Entropy Optimization Methods and Bayesian Estimation Procedure
AU - Tsao, H.S.
AU - Lee, D.N.
AU - Fang, S.
C2 - 1991///
C3 - Proceedings of Advances in Mathematics, Computations, and Reactor Physics
DA - 1991///
VL - 17
SP - 3.1 – 3.11
M1 - 2
ER -
TY - JOUR
TI - A new variant of the primal affine scaling algorithm for linear programs
AU - Jan, Gwo-Ming
AU - Fang, Shu-Cherng
T2 - Optimization
AB - In this paper, a new variant of the primal affine scaling algorithm for linear programming problem is developed. We show that under the assumptions of bounded feasible region and primal and dual nondegeneracy, the algorithm generates two sequences, {xk } and {π k }, of points that converge to the primal and the dual optimal solutions, respectively. Compared to the primal affine scaling algorithm proposed by Barnes, Cavalier-Soyster, and Vanderbei-Meketon-Freedman, the new algorithm shows a better asymptotic convergent rate. For a standard linear program with n variables and m constraints, the limiting convergent rate of the new algorithm is favored by a factor of . This result is obtained by expending “ball” to “circular cone” in the step of finding a direction vector.
DA - 1991/1//
PY - 1991/1//
DO - 10.1080/02331939108843712
VL - 22
IS - 5
SP - 681-715
J2 - Optimization
LA - en
OP -
SN - 0233-1934 1029-4945
UR - http://dx.doi.org/10.1080/02331939108843712
DB - Crossref
ER -
TY - JOUR
TI - On the convex programming approach to linear programming
AU - Rajasekera, J.R.
AU - Fang, S.C.
T2 - Operations Research Letters
AB - For a general linear program in Karmarkar's standard form, Fang recently proposed a new approach which would find an @e-optimal solution by solving an unconstrained convex dual program. The dual was constructed by applying generalized geometric programming theory to a linear programming problem. In this paper we show that Fang's results can be obtained directly using a simple geometric inequality. The new approach provides a better @e-optimal solution generation scheme in a simpler way.
DA - 1991/8//
PY - 1991/8//
DO - 10.1016/0167-6377(91)90001-6
VL - 10
IS - 6
SP - 309-312
J2 - Operations Research Letters
LA - en
OP -
SN - 0167-6377
UR - http://dx.doi.org/10.1016/0167-6377(91)90001-6
DB - Crossref
KW - LINEAR PROGRAMMING
KW - ENTROPY
KW - CONVEX PROGRAMMING
KW - GEOMETRIC PROGRAMMING
KW - DUALITY THEORY
ER -
TY - CONF
TI - Towards a Formal Semantics for Speech Acts
AU - Singh, Munindar P.
C2 - 1991/5//
C3 - Proceedings of the 2nd Meeting on the Mathematics of Language (MOL)
DA - 1991/5//
SP - 1–6
ER -
TY - CONF
TI - On the Commitments and Precommitments of Limited Agents
AU - Singh, Munindar P.
C2 - 1991/8//
C3 - Proceedings of the IJCAI Workshop on the Theoretical and Practical Design of Rational Agents
DA - 1991/8//
SP - 1–11
ER -
TY - CONF
TI - Social and Psychological Commitments in Multiagent Systems
AU - Singh, Munindar P.
C2 - 1991/11//
C3 - AAAI Fall Symposium on Knowledge and Action at Social and Organizational Levels
DA - 1991/11//
SP - 104–106
ER -
TY - CONF
TI - A Logic of Situated Know-how
AU - Singh, Munindar P.
C2 - 1991/7//
C3 - Proceedings of the National Conference on Artificial Intelligence (AAAI)
DA - 1991/7//
SP - 343–348
ER -
TY - CONF
TI - Intentions, Commitments and Rationality
AU - Singh, Munindar P.
C2 - 1991/8//
C3 - Proceedings of the 13th Annual Conference of the Cognitive Science Society
DA - 1991/8//
SP - 493–498
ER -
TY - CONF
TI - Towards a Formal Theory of Communication for Multiagent Systems
AU - Singh, Munindar P.
C2 - 1991/8//
C3 - Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI)
DA - 1991/8//
SP - 69–74
ER -
TY - CHAP
TI - Towards a formal theory of intentions
AU - Singh, Munindar P.
AU - Asher, Nicholas M.
T2 - Logics in AI. JELIA 1990
A2 - van Eijck, J.
T3 - Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)
AB - Intentions are an important concept in several subfields of Artificial Intelligence. We present a formal theory of intentions and beliefs based on Discourse Representation Theory that captures many of the important logical aspects of the functional roles of intentions and beliefs, and of relationships among intentions, and between intentions and beliefs. Unlike possible worlds approaches, this theory does not assume that agents are perfect reasoners, and gives a realistic view of their internal architecture; unlike most representational approaches, it has an objective semantics, and does not rely on an ad hoc labeling of the internal states of agents. We then describe a minimal logic for intentions and beliefs. We close with several additional inferences, and the constraints on the model that correspond to them.
PY - 1991///
DO - 10.1007/bfb0018460
SP - 472-486
PB - Springer Berlin Heidelberg
SN - 9783540536864 9783540469827
SV - 478
UR - http://dx.doi.org/10.1007/bfb0018460
ER -
TY - CHAP
TI - Numerical Studies of the Linear Quadratic Control Problem for Retarded Systems with Delay in Control
AU - Tran, Hien T.
T2 - Computation and Control II
AB - In this paper we report on the results of our continuing efforts on using the averaging approximation scheme for retarded functional differential equations. The central focus of this paper is our numerical studies of constructing feedback soLutions to linear quadratic regulator (LQR) problems for retarded systems with delay in control. For completeness, we shall also give a brief summary and discussion of an abstract approximation framework and convergence theory developed previously by Ito and Tran in[9]. In [9]we presented an approximation framework for the numerical treatment of algebraic Riccati equations for a class of linear infinite dimensional systems with unbounded input and output operators studied by Pritchard and Salamon in[19] In this paper we will call it the Pritchard-Salamon clans. This approximation theory which yields convergence of the approximating Riccati operators as well as convergence of the approximating gain operators extends earlier results developed in[7][2][8]in which the input and output operators are assumed to be bounded to the unbounded cases. The main features which distinguish the work in [9]from other work existing in the literature, see e.g.[11][14][15] are the assumptions on the smoothness of the underlined semigroup and the observation map. Because of the smoothness assumptions, the algebraic Riccati soLution has a smoothing property which in turn implies boundedness of the feedback gain operator. Although the theory developed in[9]does not cover many important boundary control problems studied by Lasiecka and Triggiani in [13] and Flandoli, Lasiecka, and Triggiani in[6] for example, it does enable us to treat the control problem governed by delay differential equations with delays in control and observation.KeywordsFeedback GainDelay Differential EquationLinear Quadratic RegulatorAlgebraic Riccati EquationBoundary Control ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
PY - 1991///
DO - 10.1007/978-1-4612-0427-5_21
SP - 307-324
OP -
PB - Birkhäuser Boston
SN - 9780817636111 9781461204275
UR - http://dx.doi.org/10.1007/978-1-4612-0427-5_21
DB - Crossref
ER -
TY - JOUR
TI - A Fully-Discrete Spectral Method for Delay-Differential Equations
AU - Ito, K.
AU - Tran, H. T.
AU - Manitius, A.
T2 - SIAM Journal on Numerical Analysis
AB - In this paper a new Lanczos-tau method for solving linear functional differential equations is introduced. The scheme has infinite order of accuracy both in time and in the delayed argument. The high accuracy in time is obtained without increasing the computational work and memory space which is needed for a one-step explicit difference scheme. The article demonstrates how to implement the algorithm in a robust and efficient manner and to treat problems with piecewise continuous initial function. Numerical results illustrating the behavior of the method when faced with difficult problems are presented and the numerical results are compared to those obtained by using two other methods.
DA - 1991/8//
PY - 1991/8//
DO - 10.1137/0728060
VL - 28
IS - 4
SP - 1121-1140
J2 - SIAM J. Numer. Anal.
LA - en
OP -
SN - 0036-1429 1095-7170
UR - http://dx.doi.org/10.1137/0728060
DB - Crossref
KW - SPECTRAL METHOD
KW - STABILITY ANALYSIS
KW - FUNCTIONAL-DIFFERENTIAL EQUATIONS
ER -
TY - JOUR
TI - Duality, observability, and controllability for linear time-varying descriptor systems
AU - Campbell, Stephen L.
AU - Nichols, Nancy K.
AU - Terrell, William J.
T2 - Circuits Systems and Signal Processing
DA - 1991/12//
PY - 1991/12//
DO - 10.1007/bf01194883
VL - 10
IS - 4
SP - 455-470
J2 - Circuits Systems and Signal Process
LA - en
OP -
SN - 0278-081X 1531-5878
UR - http://dx.doi.org/10.1007/bf01194883
DB - Crossref
KW - DESCRIPTOR
KW - SINGULAR
KW - DIFFERENTIAL-ALGEBRAIC
KW - OBSERVABILITY
KW - CONTROLLABILITY
KW - DUALITY
KW - STRUCTURAL FORMS
ER -
TY - JOUR
TI - Observability of Linear Time-Varying Descriptor Systems
AU - Campbell, Stephen L.
AU - Terrell, William J.
T2 - SIAM Journal on Matrix Analysis and Applications
AB - A characterization of observability for linear time-varying descriptor systems $E( t )x' ( t ) + F ( t ) x ( t ) = B (t) u (t), y ( t ) = C ( t ) x ( t )$, is given. E is not required to have constant rank. The characterization is designed to reduce symbolic computation and has potential advantages even when E is nonsingular. It is also shown that all observable analytic descriptor systems are smoothly observable even if they are not uniformly observable. Finally, the external behavior of time-varying descriptor systems is characterized.
DA - 1991/7//
PY - 1991/7//
DO - 10.1137/0612035
VL - 12
IS - 3
SP - 484-496
J2 - SIAM J. Matrix Anal. & Appl.
LA - en
OP -
SN - 0895-4798 1095-7162
UR - http://dx.doi.org/10.1137/0612035
DB - Crossref
KW - DESCRIPTOR
KW - SINGULAR
KW - OBSERVABILITY
KW - EXTERNAL BEHAVIOR
ER -
TY - JOUR
TI - Differentiation of Constraints in Differential-Algebraic Equations∗
AU - Campbell, Stephen L.
AU - Leimkuhler, B.
T2 - Mechanics of Structures and Machines
AB - ABSTRACT ABSTRACT Differentiation of constraints that appear in differential-algebraic equations (DAEs) has been advocated for many purposes, ranging from index reduction for numerical purposes to systems inversion in control theory. In this paper, the numerical and analytic consequences of such differentiations are studied and criteria are established for when difficulties can occur.
DA - 1991/1//
PY - 1991/1//
DO - 10.1080/08905459108905136
VL - 19
IS - 1
SP - 19-39
J2 - Mechanics of Structures and Machines
LA - en
OP -
SN - 0890-5452
UR - http://dx.doi.org/10.1080/08905459108905136
DB - Crossref
ER -
TY - CONF
TI - Hierarchical target representation for autonomous recognition using distributed sensors
AU - Luo, Ren C.
AU - Kay, Michael G.
C2 - 1991///
C3 - Proceedings of SPIE - The International Society for Optical Engineering
DA - 1991///
VL - 1383
SP - 537-544
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0025795487&partnerID=MN8TOARS
ER -
TY - JOUR
TI - A review of automated guided-vehicle systems design and scheduling
AU - King, Russell E.
AU - Wilson, Carl
T2 - Production Planning & Control
AB - Abstract Automated guided-vehicle (AGV) systems are gaining increasing acceptance in modern manufacturing facilities primarily because of the versatility they offer. As the flexibility and complexity of these systems increase, the requirements of the design effort and the routeing and scheduling system grow. In this paper we provide a review of the literature relevant to the system design, routeing and scheduling, and justification and implementation of AGV systems.
DA - 1991/1//
PY - 1991/1//
DO - 10.1080/09537289108919329
VL - 2
IS - 1
SP - 44-51
J2 - Production Planning & Control
LA - en
OP -
SN - 0953-7287 1366-5871
UR - http://dx.doi.org/10.1080/09537289108919329
DB - Crossref
ER -
TY - JOUR
TI - A Stochastic Model of the Apparel-retailing Process for Seasonal Apparel
AU - Nuttle, H. L. W.
AU - King, R. E.
AU - Hunter, N. A.
T2 - Journal of the Textile Institute
AB - A computer model is described that simulates the seasonal apparel-retailing process. The model is stochastic in nature and is designed to allow the investigation of the effects of improved retailing procedures on financial and other performance measures. Its principal value lies in the evaluation or Quick Response (QR) supply methodologies that allow frequent re-estimations of consumer demand and reorders of merchandise based on in-season point-of-sale (POS) data at the stock-keeping-unit (SKU) level.
DA - 1991/1//
PY - 1991/1//
DO - 10.1080/00405009508658762
VL - 82
IS - 2
SP - 247-259
J2 - Journal of the Textile Institute
LA - en
OP -
SN - 0040-5000 1754-2340
UR - http://dx.doi.org/10.1080/00405009508658762
DB - Crossref
ER -
TY - RPRT
TI - Alternate characterizations of the complexity graph
AU - Bein, Wolfgang W
AU - Kamburowski, Jerzy
AU - Stallmann, Matthias FM
A3 - Dept of Computer Science, North Carolina State University
DA - 1991///
PY - 1991///
PB - Dept of Computer Science, North Carolina State University
ER -
TY - JOUR
TI - A characterization of network representable polymatroids
AU - Bein, Wolfgang W
AU - Brucker, Peter
AU - Stallmann, Matthias FM
T2 - Zeitschrift für Operations Research
DA - 1991///
PY - 1991///
VL - 35
IS - 4
SP - 267-272
ER -
TY - CONF
TI - A One-way Array Algorithm for Matroid Scheduling
AU - Stallmann, Matthias FM
C2 - 1991///
C3 - Proceedings of the third annual ACM Symposium on Parallel Algorithms and Architectures
DA - 1991///
VL - 21
SP - 349-356
M1 - 24
ER -
TY - CONF
TI - Yield Optimization Using a {GaAs} Process Simulator Coupled to a Physical Device Model
AU - Stoneking, D E
AU - Bilbro, G L
AU - Trew, R J
AU - Gilmore, P
AU - Kelley, C T
T2 - IEEE
C2 - 1991///
C3 - Proceedings IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits
DA - 1991///
SP - 374-383
ER -
TY - CONF
TI - Simulated Performance Optimization of {GaAs} {MESFET} Amplifiers
AU - Winslow, T A
AU - Trew, R J
AU - Gilmore, P
AU - Kelley, C T
T2 - IEEE
C2 - 1991///
C3 - Proceedings IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits
DA - 1991///
SP - 393-402
ER -
TY - JOUR
TI - Observations on Computational Mathematics in {J}apan
AU - Kahaner, David K
AU - Kelley, C T
T2 - ONRFE Scientific Information Bulletin
DA - 1991///
PY - 1991///
VL - 16
SP - 49-54
ER -
TY - CONF
TI - Doping Profiles For Optimum Class {B} Performance of {GaAs} MESFET Amplifiers
AU - Winslow, T A
AU - Trew, R J
AU - Gilmore, P
AU - Kelley, C T
T2 - IEEE
C2 - 1991///
C3 - Proceedings IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits
DA - 1991///
SP - 188-197
ER -
TY - CONF
TI - A Study of Electron Transit-Time in Ballistic Diodes Using a Multi-Valley Hydrodynamic Transport Model
AU - Woolard, D L
AU - Trew, R J
AU - Littlejohn, M A
AU - Kelley, C T
T2 - IEEE
C2 - 1991///
C3 - Proceedings IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits
DA - 1991///
SP - 131-140
ER -
TY - JOUR
TI - Comments on 2-D descriptor systems
AU - Campbell, Stephen L.
T2 - Automatica
AB - Abstract This paper discusses general 2-D descriptor systems of the form Ex i +1, j +1 = Ax i , j + Bx i +1, j + Cx i , j +1 + D 0 u i , j + D 1 u i +1, j + D 2 u i , j +1 . Solution formula and structural forms are developed for several large classes of 2-D descriptor systems. The idea of a recursive chain is introduced. It is shown that these systems include several types of behavior not discussed elsewhere in the literature.
DA - 1991/1//
PY - 1991/1//
DO - 10.1016/0005-1098(91)90020-3
VL - 27
IS - 1
SP - 189-192
J2 - Automatica
LA - en
OP -
SN - 0005-1098
UR - http://dx.doi.org/10.1016/0005-1098(91)90020-3
DB - Crossref
KW - BOUNDARY-VALUE PROBLEM
KW - DIFFERENCE EQUATIONS
KW - DISCRETE SYSTEMS
KW - MULTIDIMENSIONAL SYSTEMS
KW - LINEAR SYSTEMS
ER -
TY - JOUR
TI - A New Proof of Superlinear Convergence for Broyden’s Method in Hilbert Space
AU - Kelley, C. T.
AU - Sachs, E. W.
T2 - SIAM Journal on Optimization
AB - Broyden’s method is an extension of the secant method for an equation in one real variable to an arbitrary Hilbert space setting. It is a result of Griewank that the Broyden iterates converge locally superlinearly to a root if, in addition to the assumptions needed in finite dimension, the initial approximation for the Frechet derivative differs from the Frechet derivative at the root only by a compact operator. In this paper a new and much simpler proof of this theorem is given based on the concept of collective compactness.
DA - 1991/2//
PY - 1991/2//
DO - 10.1137/0801011
VL - 1
IS - 1
SP - 146-150
J2 - SIAM J. Optim.
LA - en
OP -
SN - 1052-6234 1095-7189
UR - http://dx.doi.org/10.1137/0801011
DB - Crossref
KW - Broyden's method
KW - superlinear convergence
KW - collective compactness
ER -
TY - JOUR
TI - Fast Algorithms for Compact Fixed Point Problems with Inexact Function Evaluations
AU - Kelley, C. T.
AU - Sachs, E. W.
T2 - SIAM Journal on Scientific and Statistical Computing
AB - A class of fast algorithms for computation of fixed points of completely continuous maps on Banach spaces is described and analyzed. These algorithms are motivated by parabolic boundary control problems where the time integration is done by a high order backward difference formula, a variable stepsize, variable order method, or a combination of such methods. In these cases, the nonlinear maps do not have the smoothness or collective compactness properties required by known fast algorithms. This paper shows how a multilevel technique of Atkinson can be modified to attack such problems, discusses how quasi-Newton methods can improve performance, and finally, shows how this approach can be applied to parabolic boundary control problems.
DA - 1991/7//
PY - 1991/7//
DO - 10.1137/0912038
VL - 12
IS - 4
SP - 725-742
J2 - SIAM J. Sci. and Stat. Comput.
LA - en
OP -
SN - 0196-5204 2168-3417
UR - http://dx.doi.org/10.1137/0912038
DB - Crossref
KW - COLLECTIVE COMPACTNESS
KW - PARABOLIC CONTROL PROBLEMS
KW - METHOD OF LINES
KW - QUASI-NEWTON METHODS
ER -
TY - JOUR
TI - Sequential quadratic programming for certain parameter identification problems
AU - Kelley, C. T.
AU - Wright, S. J.
T2 - Mathematical Programming
DA - 1991/7//
PY - 1991/7//
DO - 10.1007/bf01586941
VL - 51
IS - 1-3
SP - 281-305
J2 - Mathematical Programming
LA - en
OP -
SN - 0025-5610 1436-4646
UR - http://dx.doi.org/10.1007/bf01586941
DB - Crossref
KW - SEQUENTIAL QUADRATIC PROGRAMMING
KW - PARAMETER IDENTIFICATION
ER -
TY - JOUR
TI - Pointwise quasi-Newton method for unconstrained optimal control problems, II
AU - Kelley, C. T.
AU - Sachs, E. W.
AU - Watson, B.
T2 - Journal of Optimization Theory and Applications
DA - 1991/12//
PY - 1991/12//
DO - 10.1007/bf00941402
VL - 71
IS - 3
SP - 535-547
J2 - J Optim Theory Appl
LA - en
OP -
SN - 0022-3239 1573-2878
UR - http://dx.doi.org/10.1007/bf00941402
DB - Crossref
KW - QUASI-NEWTON METHODS
KW - OPTIMAL CONTROL
ER -
TY - JOUR
TI - Mesh Independence of Newton-like Methods for Infinite Dimensional Problems
AU - Kelley, C.T.
AU - Sachs, E.W.
T2 - Journal of Integral Equations and Applications
AB - Globally convergent modifications of Newton’s method, such as the Armijo rule, can be applied to infinite dimensional problems and their discretizations. We show that if the construction of the discretizations is done properly, then the convergence behavior of the iteration is the same for the discrete problems as it is for the infinite-dimensional problem. Basic to these results is the use of the concept of discrete convergence as a tool to measure the performance of algorithms and a new setting of Banach spaces with incomplete metrics, for example, norms generated by continuous inner products. The motivating problems are integral equations with continuous kernels. This result extends to the globally convergent case results of Allgower, Bohmer, Potra, and Rheinboldt, and the authors. In addition, we strengthen the previous results on mesh independence of quasi-Newton methods. Numerical results are reported that illustrate the results.
DA - 1991/12//
PY - 1991/12//
DO - 10.1216/jiea/1181075649
VL - 3
IS - 4
SP - 549-573
J2 - J. Integral Equations Appl.
LA - en
OP -
SN - 0897-3962
UR - http://dx.doi.org/10.1216/jiea/1181075649
DB - Crossref
ER -
TY - CHAP
TI - Some Remarks on the Generalised Bareiss and Levinson Algorithms
AU - Ipsen, Ilse
T2 - Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms
PY - 1991///
DO - 10.1007/978-3-642-75536-1_10
SP - 189-214
OP -
PB - Springer Berlin Heidelberg
SN - 9783642755385 9783642755361
UR - http://dx.doi.org/10.1007/978-3-642-75536-1_10
DB - Crossref
ER -
TY - RPRT
TI - Perturbation Theory for the Solution of Systems of Linear Equations
AU - Chandrasekaran, Shivkumar
AU - Ipsen, Ilse
A3 - Defense Technical Information Center
AB - Abstract : We present expressions for absolute and relative errors in individual components of the solution to systems of linear equations. We consider three kinds of linear systems: non-singular, underdetermined of full row rank, and least squares of full column rank. No assumptions regarding the structure or distribution of the perturbations are required. Our expressions for component- wise relative errors allow the following conclusions: For any linear system there is at least one solution component whose sensitivity to perturbations is proportional to the condition number of the matrix; but - depending on the relation between right-hand side and matrix - there may exist components that are much better conditioned. For a least squares problem, the sensitivity of the components also depends on the right-hand side and may be as high as the square of the condition number. Least squares problems are therefore always more receptive to ill-conditioning than linear systems. In addition, we show that the component-wise relative errors for linear systems are reduced by column scaling only if column scaling manages to reduce the perturbations. Regarding underdetermined linear systems of full column rank, the problem of finding the minimal-norm solution can be formulated so that the same analysis as for least squares problems is applicable here as well. Finally, we define component-wise condition numbers that measure the sensitivity of the solution components to perturbations. They have simple geometric interpretations and can be command estimated as efficiently as the conventional condition numbers.
DA - 1991/10/1/
PY - 1991/10/1/
DO - 10.21236/ada254994
PB - Defense Technical Information Center
UR - http://dx.doi.org/10.21236/ada254994
DB - Crossref
ER -
TY - JOUR
TI - The Sinc-Galerkin Method for Fourth-Order Differential Equations
AU - Smith, Ralph C.
AU - Bogar, Gary A.
AU - Bowers, Kenneth L.
AU - Lund, John
T2 - SIAM Journal on Numerical Analysis
AB - The Sinc-Galerkin method originally proposed by Stenger is extended to handle fourth-order ordinary differential equations. The exponential convergence rate of the method, $O(e^{ - \kappa \sqrt M } )$ is carefully developed and the special features of the discrete system are described. Spectral properties and conditioning of the associated matrices are given. The appropriate choice of weight function in the Galerkin inner product is discussed with primary emphasis given to choices that are best suited to fourth-order partial differential equations. Numerical results are included to help illustrate the parameter selections made and confirm the efficiency and accuracy of the method.
DA - 1991/6//
PY - 1991/6//
DO - 10.1137/0728041
VL - 28
IS - 3
SP - 760-788
J2 - SIAM J. Numer. Anal.
LA - en
OP -
SN - 0036-1429 1095-7170
UR - http://dx.doi.org/10.1137/0728041
DB - Crossref
KW - SINC-GALERKIN
KW - 4TH-ORDER DIFFERENTIAL EQUATIONS
ER -
TY - JOUR
TI - Red Cockaded Woodpecker and Pine Straw Production: An Economic Analysis
AU - Roise, J.P.
AU - Chung, J.
AU - Lancia, R.
T2 - Southern Journal of Applied Forestry
DA - 1991///
PY - 1991///
VL - 15
IS - 2
SP - 88–92
ER -
TY - JOUR
TI - An Optimal Apportionment Strategy for Park Operations
AU - Siderelis, C.
AU - Roise, J.P.
T2 - Journal of Park and Recreation Admin
DA - 1991///
PY - 1991///
VL - 9
IS - 2
SP - 48–58
ER -
TY - CONF
TI - Program design with algebraic specifications
C2 - 1991///
DA - 1991///
SP - 345-352
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0025857871&partnerID=MN8TOARS
ER -
TY - JOUR
TI - PREDICTING DOWNTURNS IN THE UNITED-STATES TEXTILE-INDUSTRY BUSINESS CYCLES
AU - SUH, MW
AU - TERRIEN, PG
T2 - JOURNAL OF THE TEXTILE INSTITUTE
AB - A probability model is applied to predict sudden downturns in the U.S. textile-industry business cycles on the basis of the available statistical data. The results indicate that the model, while satisfactory for other cyclical business data, is not highly satisfactory for predicting downturns in the U.S. textile-industry business cycles.
DA - 1991///
PY - 1991///
DO - 10.1080/00405009508658761
VL - 82
IS - 2
SP - 233-245
SN - 0040-5000
ER -
TY - JOUR
TI - Variance of neutral genetic variances within and between populations for a quantitative character
AU - Zeng, Z. B.
AU - Cockerham, C. C.
T2 - Genetics
DA - 1991///
PY - 1991///
VL - 129
IS - 2
SP - 535
ER -