TY - CONF
TI - Computer-Aided Process Planning
AU - Ulusoy, G.
AU - Uzsoy, R.
AU - Turfanda, I.
T2 - 3rd National Computer Conference
C2 - 1986/4//
C3 - Proceedings of the 3rd National Computer Conference, Istanbul,Turkey
CY - Istanbul,Turkey
DA - 1986/4//
PY - 1986/4//
ER -
TY - CONF
TI - An Application of Computer-Aided Process Planning
AU - Ulusoy, G.
AU - Uzsoy, R.
AU - Turfanda, I.
AU - Alatli, L.
AU - Uzuner, M.
T2 - 2nd National Conference on Machine Design and Production
C2 - 1986/9//
C3 - Proceedings of the 2nd National Conference on Machine Design and Production
CY - Middle East Technical University, Ankara, Turkey
DA - 1986/9//
PY - 1986/9//
ER -
TY - THES
TI - Theoretical studies on genetic limits to natural and artificial selection with mutation
AU - Zeng, Z.-B.
DA - 1986///
PY - 1986///
M3 - Ph.D Thesis
PB - Department of Genetics, The University of Edinburgh
ER -
TY - JOUR
TI - The selection limit due to the conflict between truncation and stabilizing selection with mutation
AU - Zeng, Z.-B.
AU - Hill, W.G.
T2 - Genetics
DA - 1986///
PY - 1986///
VL - 114
SP - 1313–1328
ER -
TY - CHAP
TI - Consistent initial conditions for linear time varying singular systems
AU - Campbell, Stephen L.
T2 - Frequency Domain and State Space Methods for Linear Systems
A2 - Byrnes, C. I.
A2 - Lindquist, A.
PY - 1986///
SP - 313–318
PB - Elsevier
SN - 9780444700384
ER -
TY - RPRT
TI - Systolic implementation of a Toeplitz system solver
AU - Delosme, J.-M.
AU - Ipsen, I.C.F.
AU - Masse, J.-R.
A3 - Department of Electrical Engineering, Yale University
DA - 1986///
PY - 1986///
M1 - 8607
M3 - Research Report
PB - Department of Electrical Engineering, Yale University
SN - 8607
ER -
TY - CHAP
TI - Systolic array synthesis: Computability and time cones
AU - Delosme, J.-M.
AU - Ipsen, I.C.F.
T2 - Parallel Algorithms and Architectures
PY - 1986///
SP - 295–312
PB - North-Holland Publishing
ER -
TY - CONF
TI - The North Carolina State University Experience with FORPLAN
AU - Roise, J.P.
AU - Welker, J.
T2 - FORPLAN: An Evaluation of a Forest Planning Tool
C2 - 1986/11/4/
C3 - FORPLAN: An Evaluation of a Forest Planning Tool: Proceedings of a Symposium
CY - Denver, CO
DA - 1986/11/4/
PY - 1986/11/4/
SP - 73-82
ER -
TY - CONF
TI - Nonlinear Programming Applications in Forest Industry: Examples in Kiln Drying, Forest Management and Wildlife Management
AU - Roise, J.P.
T2 - Joint National Meeting of ORSA and TIMS
C2 - 1986/4/14/
CY - Los Angeles, CA
DA - 1986/4/14/
PY - 1986/4/14/
ER -
TY - CONF
TI - Interactive Mathematical Programming: Users Manual
AU - Roise, J.P.
T2 - Forestry Microcomputer Software Symposium
C2 - 1986/6/30/
CY - Morganton, WV
DA - 1986/6/30/
PY - 1986/6/30/
PB - West Va
ER -
TY - CONF
TI - Stand Level Optimization on Microcomputers
AU - Roise, J.P.
T2 - Forestry Microcomputer Software Symposium
C2 - 1986/6/30/
C3 - Proceedings of Forestry Microcomputer Software Symposium
CY - Morganton, WV
DA - 1986/6/30/
PY - 1986/6/30/
ER -
TY - RPRT
TI - Dynamic Facility Network Planning – Design Architecture
AU - Slutsman, L.A.
AU - Fang, S.
DA - 1986/2//
PY - 1986/2//
M1 - 54112-860226-01
M3 - AT&T Bell Laboratories Technical Memorandum
SN - 54112-860226-01
ER -
TY - RPRT
TI - Dynamic Facility Network Planning – A Solution Architecture with Block Cholesky Factorization
AU - Fang, S.
DA - 1986/3//
PY - 1986/3//
M1 - 54112-860305-01
M3 - AT&T Bell Laboratories Technical Memorandum
SN - 54112-860305-01
ER -
TY - RPRT
TI - Dynamic Facility Network Planning – A Linear Programming Loader with Arbitrary Incremental Demands and Rearrangement Capabilities
AU - Fang, S.
DA - 1986/6//
PY - 1986/6//
M1 - 54112-860610-01
M3 - AT&T Bell Laboratories Technical Memorandum
SN - 54112-860610-01
ER -
TY - RPRT
TI - A Perturbation Approach to the Main Duality Theorem of Quadratic Geometric Programs
AU - Rajasekera, J.R.
AU - Fang, S.
DA - 1986/7//
PY - 1986/7//
M1 - 54142-860718-01
M3 - AT&T Bell Laboratories Technical Memorandum
SN - 54142-860718-01
ER -
TY - JOUR
TI - Controlled perturbations for quadratically constrained quadratic programs
AU - Fang, S. C.
AU - Rajasekera, J. R.
T2 - Mathematical Programming
DA - 1986/10//
PY - 1986/10//
DO - 10.1007/bf02592062
VL - 36
IS - 3
SP - 276-289
J2 - Mathematical Programming
LA - en
OP -
SN - 0025-5610 1436-4646
UR - http://dx.doi.org/10.1007/bf02592062
DB - Crossref
ER -
TY - JOUR
TI - Comments on "An iterative method for generalized complementarity problems"
AU - Fang, S.
T2 - IEEE Transactions on Automatic Control
AB - In an earlier paper, the author proposed an iterative method for generalized complementarity problems with Lipschitz continuous and strongly monotone functions. Here we show that a slightly modified method can be developed to solve a generalized complementarity problem with a Lipschitz continuous, pseudomonotone, and integrable function.
DA - 1986/11//
PY - 1986/11//
DO - 10.1109/tac.1986.1104154
VL - 31
IS - 11
SP - 1083-1084
J2 - IEEE Trans. Automat. Contr.
OP -
SN - 0018-9286 1558-2523
UR - http://dx.doi.org/10.1109/tac.1986.1104154
DB - Crossref
ER -
TY - JOUR
TI - Controlled dual perturbations for l p -programming
AU - Fang, S. C.
AU - Rajasekera, J. R.
T2 - Zeitschrift für Operations Research
AB - l p -programming is a common generalization of linear programming, quadratically constrained quadratic programming,l p -constrainedl p -approximation, and multiple criteria compromise programming. It is a type of convex programming with objective function and inequality constraints expressed by means ofl p -norms. The dual program established by Peterson and Ecker is a maximization problem with a concave, upper-semicontinuous objective function over a set of constraints that are essentially linear. In developing a dual method for this problem, we face two major difficulties. One is the non-differentiability of the dual objective function and the other one is an efficient dual-to-primal conversion.
DA - 1986/1//
PY - 1986/1//
DO - 10.1007/bf01918629
VL - 30
IS - 1
SP - A29-A42
J2 - Zeitschrift für Operations Research
LA - en
OP -
SN - 0340-9422 1432-5217
UR - http://dx.doi.org/10.1007/bf01918629
DB - Crossref
ER -
TY - JOUR
TI - Numerical simulation of a non-linear feedback controller for a wind tunnel model involving a time delay
AU - Manitius, A.
AU - Tran, H.
T2 - Optimal Control Applications and Methods
AB - Abstract This paper describes a non‐linear, S‐minimum time, feedback controller for a wind tunnel model and a numerical simulation of its performance. The model is a linear third‐order system with delay and a state‐variable constraint; it represents the dynamics of a Mach number control loop in a cryogenic wind tunnel. The design method involves a singular perturbation technique, an impulse control and a compensation of delay. Peformance of linear and non‐linear S‐minimum time control is compared in various operating conditions. The closed‐loop dynamics of the non‐linear system is examined by numerical simulations which exhibit the boundary‐layer phenomena in the control and the effects of various changes in parameters.
DA - 1986/1//
PY - 1986/1//
DO - 10.1002/oca.4660070103
VL - 7
IS - 1
SP - 19-39
J2 - Optim. Control Appl. Meth.
LA - en
OP -
SN - 0143-2087 1099-1514
UR - http://dx.doi.org/10.1002/oca.4660070103
DB - Crossref
ER -
TY - JOUR
TI - Index two linear time varying singular systems of differential equations
AU - Campbell, Stephen L.
T2 - Circuits, Systems, and Signal Processing
DA - 1986/3//
PY - 1986/3//
DO - 10.1007/bf01600189
VL - 5
IS - 1
SP - 97-107
J2 - Circuits Systems and Signal Process
LA - en
OP -
SN - 0278-081X 1531-5878
UR - http://dx.doi.org/10.1007/bf01600189
DB - Crossref
ER -
TY - JOUR
TI - Countability of Sets
AU - Campbell, Stephen L.
T2 - The American Mathematical Monthly
DA - 1986/6//
PY - 1986/6//
DO - 10.1080/00029890.1986.11971864
VL - 93
IS - 6
SP - 480-481
J2 - The American Mathematical Monthly
LA - en
OP -
SN - 0002-9890 1930-0972
UR - http://dx.doi.org/10.1080/00029890.1986.11971864
DB - Crossref
ER -
TY - JOUR
TI - An augmenting path algorithm for linear matroid parity
AU - Gabow, Harold N
AU - Stallmann, Matthias
T2 - Combinatorica
DA - 1986///
PY - 1986///
VL - 6
IS - 2
SP - 123-150
ER -
TY - JOUR
TI - Convergence of the {F_N} method for multi-group transport
AU - Kelley, C T
T2 - Trans. Th. Stat. Phys.
DA - 1986///
PY - 1986///
VL - 15
SP - 821-828
ER -
TY - JOUR
TI - A Shamanskii-like acceleration scheme for nonlinear equations at singular roots
AU - Kelley, C.T.
T2 - Mathematics of Computation
DA - 1986///
PY - 1986///
VL - 47
IS - 176
SP - 609–623
ER -
TY - RPRT
TI - Progress Report Number 2 on Contract AFOSR-84-0240.
AU - Campbell, Stephen L.
A3 - Defense Technical Information Center
AB - Abstract : Implicit systems of differential equations of the form F(t,y,y') = 0 naturally arise in many circuit and control problems, economic models, and the solution of partial differential equations by the method of lines. Implicit systems are also called singular, differential-algebraic, semi-state, constrained, and descriptor. The theory is well understood, and numerical codes exist, for index zero, index one, and linear constant coefficient problems. Higher index systems occur in circuit and control problems. The numerical and analytic behavior of such higher index systems is not well understood and is incomplete. It has recently been shown that traditional methods, such as backward differences, need not work on higher index systems. Good characterizations of the solution manifold are often difficult to obtain. This research project is to study the numerical and analytic solution of higher index implicit differential equations. Applications will be made to circuit theory, control theory, and the analysis of numerically ill-conditioned index one systems.
DA - 1986/1/1/
PY - 1986/1/1/
DO - 10.21236/ada172881
PB - Defense Technical Information Center
ER -
TY - JOUR
TI - Vector algorithms for H-equations arising in radiative transfer through inhomogeneous media
AU - Hollis, S. L.
AU - Kelley, C. T.
T2 - Transport Theory and Statistical Physics
AB - Abstract The exit distribution problem for one speed isotropic radiative transfer in an inhomogeneous slab can be solved in terms of an analog of the Chandrasekhar H-Function. This function is the solution to a nonlinear integral equation in two variables for one group problems and in more variables for multi-group problems. In this paper we give algorithms for vector computers, in particular the CDC Cyber 205, that make it practical to solve such equations.
DA - 1986/2//
PY - 1986/2//
DO - 10.1080/00411458608210443
VL - 15
IS - 1-2
SP - 33-48
J2 - Transport Theory and Statistical Physics
LA - en
OP -
SN - 0041-1450 1532-2424
UR - http://dx.doi.org/10.1080/00411458608210443
DB - Crossref
ER -
TY - JOUR
TI - Convergence of the FN - method for multi-group transport
AU - Kelley, C. T.
T2 - Transport Theory and Statistical Physics
AB - Abstract This note extends previous results of Mullikin and the author on convergence of the FN method to isotropic multi-group problems in half-space geometries.
DA - 1986/10//
PY - 1986/10//
DO - 10.1080/00411458608212717
VL - 15
IS - 6-7
SP - 821-828
J2 - Transport Theory and Statistical Physics
LA - en
OP -
SN - 0041-1450 1532-2424
UR - http://dx.doi.org/10.1080/00411458608212717
DB - Crossref
ER -
TY - JOUR
TI - Complexity of dense-linear-system solution on a multiprocessor ring
AU - Ipsen, Ilse C.F.
AU - Saad, Youcef
AU - Schultz, Martin H.
T2 - Linear Algebra and its Applications
AB - Different algorithms, based on Gaussian elimination, for the solution of dense linear systems of equations are discussed for a multiprocessor ring. The number of processors is assumed not to exceed the problem size. A fairly general model for data transfer is proposed, and the algorithms are analyzed with respect to their requirements of arithmetic as well as communication times.
DA - 1986/5//
PY - 1986/5//
DO - 10.1016/0024-3795(86)90169-2
VL - 77
IS - C
SP - 205-239
J2 - Linear Algebra and its Applications
LA - en
OP -
SN - 0024-3795
UR - http://dx.doi.org/10.1016/0024-3795(86)90169-2
DB - Crossref
ER -
TY - CHAP
TI - The Impact of Parallel Architectures on The Solution of Eigenvalue Problems
AU - Ipsen, Ilse C.F.
AU - Saad, Youcef
T2 - Large Scale Eigenvalue Problems, Proceedings of the IBM Europe Institute Workshop on Large Scale Eigenvalue Problems
AB - This paper presents a short survey of recent work on parallel implementations of Numerical Linear Algebra algorithms with emphasis on those relating to the solution of the symmetric eigenvalue problem on loosely coupled multiprocessor architectures. The vital operations in the formulation of most eigenvalue algorithms are matrix vector multiplication, matrix transposition, and linear system solution. Their implementations on several representative multiprocessor systems will be described, as well as parallel implementations of the following classes of eigenvalue methods : QR, bisection, divide-and-conquer, and Lanczos algorithm.
PY - 1986///
DO - 10.1016/s0304-0208(08)72638-0
VL - 127
SP - 37-49
OP -
PB - Elsevier
SN - 9780444700742
UR - http://dx.doi.org/10.1016/s0304-0208(08)72638-0
DB - Crossref
ER -
TY - CONF
TI - Design Methodology For Systolic Arrays
AU - Delosme, Jean-Marc
AU - Ipsen, Ilse C. F.
T2 - 30th Annual Technical Symposium
A2 - Speiser, Jeffrey M.
AB - Many important algorithms in signal and image processing, speech and pattern recognition or matrix computations consist of coupled systems of recurrence equations. Systolic arrays are regular networks of tightly coupled simple processors with limited storage that provide cost-effective high-throughput implementations of many such algorithms. While there are some mathematical techniques for finding efficient systolic implementations for uniform recurrence equations, there is no general theory for more general coupled systems of affine recurrence equations. The first elements of such a theory are presented in this paper.
C2 - 1986/4/4/
C3 - Advanced Algorithms and Architectures for Signal Processing I
DA - 1986/4/4/
DO - 10.1117/12.936899
VL - 696
SP - 245-259
PB - SPIE
UR - http://dx.doi.org/10.1117/12.936899
DB - Crossref
ER -
TY - JOUR
TI - Parallel solution of symmetric positive definite systems with hyperbolic rotations
AU - Delosme, Jean-Marc
AU - Ipsen, Ilse C.F.
T2 - Linear Algebra and its Applications
AB - An algorithm based on hyperbolic rotations is presented for the solution of linear systems of equations Ax = b, with symmetric positive definite coefficient matrix A. Forward elimination and backsubstitution are replaced by matrix-vector multiplications, rendering the method amenable to implementation on a variety of parallel and vector machines. This method can be simplified and formulated without square roots if A is also Toeplitz; a systolic (VLSI) architecture implementing the resulting recurrence equations is more efficient than previously proposed pipelined Toeplitz system solvers. The hardware count becomes independent of the matrix size if its inverse is banded.
DA - 1986/5//
PY - 1986/5//
DO - 10.1016/0024-3795(86)90163-1
VL - 77
IS - C
SP - 75-111
J2 - Linear Algebra and its Applications
LA - en
OP -
SN - 0024-3795
UR - http://dx.doi.org/10.1016/0024-3795(86)90163-1
DB - Crossref
ER -
TY - JOUR
TI - An Approach for Optimizing Residual Diameter Class Distributions When Thinning Even-aged Stands
AU - Roise, Joseph P.
T2 - Forest Sci
DA - 1986///
PY - 1986///
VL - 32
IS - 4
ER -
TY - JOUR
TI - A nonlinear Programming Approach to Stand Level Optimization
AU - Roise, Joseph P.
T2 - Forest Science
DA - 1986///
PY - 1986///
VL - 32
IS - 3
SP - 735–748
ER -