Results 1  10
of
11
Analysis of eddycurrent losses over conductive substrates with applications to monolithic inductors and transformers
 IEEE Transactions on Microwave Theory and Techniques
, 2001
"... Abstract—In this paper, a closedform integral representation for the eddycurrent losses over a conductive substrate is presented. The results are applicable to monolithic inductors and transformers, especially when such structures are realized over an epitaxial CMOS substrate. The technique is ver ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, a closedform integral representation for the eddycurrent losses over a conductive substrate is presented. The results are applicable to monolithic inductors and transformers, especially when such structures are realized over an epitaxial CMOS substrate. The technique is verified against measured results from 100 MHz to 14 GHz for spiral inductors. Index Terms—CMOS substrate losses, eddy currents, monolithic inductors, monolithic transformers, spiral inductors, spiral transformers. I.
HighPerformance Numerical Software for Control
 IEEE Control Syst. Mag
, 2004
"... this article is as follows. First, we discuss the requirements for highquality control software, giving some illustrative examples and indicating the features of highquality software in the context of numerical computation. We then give an overview of linear algebra and control libraries that have ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
(Show Context)
this article is as follows. First, we discuss the requirements for highquality control software, giving some illustrative examples and indicating the features of highquality software in the context of numerical computation. We then give an overview of linear algebra and control libraries that have been important influences in the development of SLICOT, describe the recent history of SLICOT, and follow with a section on the functional capabilities of SLICOT. Next we discuss and illustrate the performance of SLICOT and then describe some userfriendly interfaces to SLICOT. Finally, we indicate some future directions
Benchmarking for Distributed Memory Parallel Systems: Gaining Insight from Numbers
"... . The inherent difficulties of benchmarking parallel computers and the motivation behind the development of the GENESIS benchmark suite introduce the paper. Some of the broader issues that must be taken into account with any rigorous benchmarking effort on a distributed memory system are then discus ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. The inherent difficulties of benchmarking parallel computers and the motivation behind the development of the GENESIS benchmark suite introduce the paper. Some of the broader issues that must be taken into account with any rigorous benchmarking effort on a distributed memory system are then discussed together with a relevant example. The initial version of the GENESIS benchmarks was used to evaluate the SUPRENUM computer. The later releases of the suite have been developed to achieve portability of codes across different distributed memory systems by means of the PARMACS macros. Strict portability is however infeasible due to the relative immaturity of current distributed memory computers and the presence of so many different architectures. Therefore some aspects of transportable software are also described, which were felt important when porting the benchmarks to different parallel platforms. 1 Introduction Benchmarking is one of those activities that everyone claims to know someth...
Numerical Linear Algebra and Computer Architecture: An Evolving Interaction
, 1993
"... The aim of this report is to highlight the evolving interaction between computer architecture on the one hand and the design and analysis of algorithms for numerical linear algebra on the other. This report can best be described as a collection of pointers to aspects of the development processes of ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The aim of this report is to highlight the evolving interaction between computer architecture on the one hand and the design and analysis of algorithms for numerical linear algebra on the other. This report can best be described as a collection of pointers to aspects of the development processes of numerical linear algebra, and to various existing surveys and software. The rich variety of activity in design, analysis, comparison and evaluation of algorithms, new and old, is examined in the context of rapid technological and architectural advance. The characteristics of algorithms for linear algebra are discussed without going into mathematical details: There are references to important surveys that provide such details. Reflections on the practices of numerical linear algebra will, it is hoped, point to possibilities for and limitations of automating the "mapping" of algorithms onto high performance computers.
Recent Developments in Dense Numerical Linear Algebra
, 1997
"... We survey recent developments in dense numerical linear algebra, covering linear systems, least squares problems and eigenproblems. Topics considered include the design and analysis of block, partitioned and parallel algorithms, condition number estimation, componentwise error analysis, and the comp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We survey recent developments in dense numerical linear algebra, covering linear systems, least squares problems and eigenproblems. Topics considered include the design and analysis of block, partitioned and parallel algorithms, condition number estimation, componentwise error analysis, and the computation of practical error bounds. Frequent reference is made to LAPACK, the state of the art package of Fortran software designed to solve linear algebra problems efficiently and accurately on highperformance computers.
Fast Parallel Solution of Boundary Integral Equations and Related Problems
, 2004
"... This article is concerned with the efficient numerical solution of Fredholm integral equations on a parallel computer with shared or distributed memory. Parallel algorithms for both, the approximation of the discrete operator by hierarchical matrices and the parallel matrixvector multiplication of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This article is concerned with the efficient numerical solution of Fredholm integral equations on a parallel computer with shared or distributed memory. Parallel algorithms for both, the approximation of the discrete operator by hierarchical matrices and the parallel matrixvector multiplication of such matrices by a vector, are presented. The first algorithm has a complexity of order 1pN log 2d−1 N, while the latter is of order 1pN log d N, where N and p are the number of unknowns and the number of processors, respectively. The Happroximant needs O 1 pN log d N units of storage on each processor.
Benchmarking a Shared Memory System
, 2003
"... For the evaluation of shared memory systems several programs were chosen and ported to different, today available computer systems. These applications represent important aspects of our numerical and algorithmic research. Beside the evaluation of the processor performance, the programs were chosen t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
For the evaluation of shared memory systems several programs were chosen and ported to different, today available computer systems. These applications represent important aspects of our numerical and algorithmic research. Beside the evaluation of the processor performance, the programs were chosen to test the scalability of the systems w.r.t. memory and the number of CPUs. The main characteristics of the benchmarked computer systems and the results from the individual benchmarks are presented. Furthermore, problems which occurred while porting the programs are discussed.
Prototype of the National HighPerformance Software Exchange
 IEEE Computational Science & Engineering, Summer
, 1995
"... This report describes a shortterm effort to construct a prototype for the National HighPerformance Software Exchange (NHSE). The prototype demonstrates how the evolving National Information Infrastructure (NII) can be used to facilitate sharing of software and information among members of the High ..."
Abstract
 Add to MetaCart
This report describes a shortterm effort to construct a prototype for the National HighPerformance Software Exchange (NHSE). The prototype demonstrates how the evolving National Information Infrastructure (NII) can be used to facilitate sharing of software and information among members of the High Performance Computing and Communications (HPCC) community. Shortcomings of current information searching and retrieval tools are pointed out, and recommendations are given for areas in need of further development. The hypertext home page for the NHSE is accessible at http://www.netlib.org/nse/home.html. 1 Introduction Over the course of a twomonth period, the NHSE developers team, consisting of researchers at the member institutions of the Center for Research on Parallel Computation, have undertaken the task of producing a prototype of the National HighPerformance Software Exchange (NHSE). The NHSE is intended as an Internetaccessible resource which will facilitate the exchange of softw...
Recent Developments in Dense Numerical Linear Algebra
"... We survey recent developments in dense numerical linear algebra, covering linear systems, least squares problems and eigenproblems. Topics considered include the design and analysis of block, partitioned and parallel algorithms, condition number estimation, componentwise error analysis, and the comp ..."
Abstract
 Add to MetaCart
(Show Context)
We survey recent developments in dense numerical linear algebra, covering linear systems, least squares problems and eigenproblems. Topics considered include the design and analysis of block, partitioned and parallel algorithms, condition number estimation, componentwise error analysis, and the computation of practical error bounds. Frequent reference is made to LAPACK, the state of the art package of Fortran software designed to solve linear algebra problems efficiently and accurately on highperformance computers. 1 Introduction Numerical linear algebra with dense matrices is still today, as it was at the time of the first IMA meeting on the State of the Art in Numerical Analysis in 1965, an extremely active area of research. There are several reasons. First, we still do not fully understand some of the classical algorithms. For example, the behaviour of the growth factors for Gaussian elimination and its variants with partial and complete pivoting is not yet completely understood. S...