Nothing Special   »   [go: up one dir, main page]

Goto et al., 1976 - Google Patents

Sparse matrix techniques for the shortest path problem

Goto et al., 1976

Document ID
7394867668185594375
Author
Goto S
Ohtsuki T
Yoshimura T
Publication year
Publication venue
IEEE Transactions on Circuits and Systems

External Links

Snippet

Two methods of implementing computer programs for solving the shortest path problem are presented. By symbolic processing, a computer program generates another program or an address table which represents an optimal shortest path algorithm, in the sense that only …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G06F17/12—Simultaneous equations, e.g. systems of linear equations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
Fujita et al. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation
van Der Vorst A vectorizable variant of some ICCG methods
Reinsch A simple expression for the terms in the Baker–Campbell–Hausdorff series
Benner et al. Balanced truncation model reduction of large-scale dense systems on parallel computers
Wallace et al. Markovian models and numerical analysis of computer system behavior
Baccelli et al. Parallel simulation of stochastic petri nets using recurrence equations
Takine et al. A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
Goto et al. Sparse matrix techniques for the shortest path problem
Deacon et al. A finite element method for a boundary value problem of mixed type
Denk et al. Exhaustive scheduling and retiming of digital signal processing systems
Kao et al. Analyses of an M/M/N/queue with server's vacations
Chen et al. Solving linear systems on a GPU with hierarchically off-diagonal low-rank approximations
Merkel et al. Iterative solution of large-scale 3D-BEM industrial problems
Chen et al. The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
US20120123746A1 (en) Exact parameter space reduction for numerically integrating parameterized differential equations
Reiser et al. On the convolution algorithm for separable queuing networks
Peters Tree machines and divide-and-conquer algorithms
Evans A second improved digit-reversal permutation algorithm for fast transforms
Burge et al. Infinite structures in Scratchpad II
Nakajima et al. Design of highly parallel linear digital system for ULSI processors
Groote Throughput analysis of dataflow graphs
Heinig et al. Fast algorithms for centro-symmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices
Watt A fixed point method for power series computation
Tsanakas et al. An FP-based design methodology for problem-oriented architectures
Gambin et al. A new combinatorial algorithm for large markov chains