Linear algebra
2,639 resources related to Linear algebra
IEEE Organizations related to Linear algebra
Back to TopConferences related to Linear algebra
Back to Top2014 American Control Conference  ACC 2014
All areas of the theory and practice of automatic control, including but not limited to network control systems, model predictive control, systems analysis in biology and medicine, hybrid and switched systems, aerospace systems, power and energy systems and control of nano and microsystems.
2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS)
The 51st Annual Symposium on Foundations of Computer Science (FOCS2010), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held at the Monte Carlo Hotel in Las Vegas, Nevada, October 2426, 2010. A series of tutorial presentations will be given on October 23. Papers presenting new and original research on the theory of computation are sought, including papers that broaden the reach of computer science theory, or raise important problems that can ben
Periodicals related to Linear algebra
Back to TopComputers, IEEE Transactions on
Design and analysis of algorithms, computer systems, and digital networks; methods for specifying, measuring, and modeling the performance of computers and computer systems; design of computer components, such as arithmetic units, data storage devices, and interface devices; design of reliable and testable digital devices and systems; computer networks and distributed computer systems; new computer organizations and architectures; applications of VLSI ...
The most highlycited general interest journal in electrical engineering and computer science, the Proceedings is the best way to stay informed on an exemplary range of topics. This journal also holds the distinction of having the longest useful archival life of any EE or computer related journal in the world! Since 1913, the Proceedings of the IEEE has been the ...
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Integrated circuits and systems;VLSI based Architecture and applications; highspeed circuits and interconnect; mixedsignal SoC; speed/area/power/noise tradeoffs in CMOS circuits.
Xplore Articles related to Linear algebra
Back to TopRouting linear permutations through the omega network in two passes
J. Keohane; R. E. Stearns Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation, 1988
The problem of routing permutations through an omega network connecting a set of processors is studied in the framework of linear algebra. The class of linear permutations is defined, and it is shown that any linear permutation can be routed through the omega network in two passes. Furthermore, the address of the intermediary processor for the routing can be found ...
K. R. Jackson IEEE Transactions on Magnetics, 1991
The parallel solution of initial value problems for ordinary differential equations has become an active area of research. Recent developments in this area are surveyed with particular emphasis on traditional forwardstep methods that offer the potential for effective smallscale parallelism on existing machines.
On minimizing the maximum of two quadratic functions
Alexandr Halukov; Lyudmila Polyakova; Ninel Solomeychuk 2015 International Conference "Stability and Control Processes" in Memory of V.I. Zubov (SCP), 2015
The problem of minimizing the maximum of two strongly convex quadratic functions on Rn is considered. It is shown that in some cases this problem is equivalent to finding the positive root of a polynomial of the degree 2n or less.
On Matrix Multiplication Using Programmable Graph Architecture
Manish Kumar Shukla; A. Yavuz Oruc 2007 41st Annual Conference on Information Sciences and Systems, 2007
Recently, Tang et. al. introduced an algorithm called the programmable graph architecture (PGA) algorithm for multiplying matrices in GL(n,mu), the generalized linear group of matrices modulo mu, where mu is an integer, using its Cayley graph representation. The problem of multiplying matrices in GL(n,mu) is mapped to the problem of finding routes on a suitable Cayley graph representation of the ...
Dynamic scene analysis and the 8point algorithm
SuShing Chen [1988 Proceedings] 9th International Conference on Pattern Recognition, 1988
Some extended versions of the 8point algorithm of H.C. LonguetHiggins (1981, 1984) are presented. First, the algorithm is extended to (not necessarily rigid) affine transformations. Differentiable transformations are also discussed. Second, the solution of all the affine transformations for the 8point algorithm, given any point correspondences, is shown to have dimension 9r, where r is the rank of given point ...
More Xplore Articles
Educational Resources on Linear algebra
Back to TopeLearning
Routing linear permutations through the omega network in two passes
J. Keohane; R. E. Stearns Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation, 1988
The problem of routing permutations through an omega network connecting a set of processors is studied in the framework of linear algebra. The class of linear permutations is defined, and it is shown that any linear permutation can be routed through the omega network in two passes. Furthermore, the address of the intermediary processor for the routing can be found ...
K. R. Jackson IEEE Transactions on Magnetics, 1991
The parallel solution of initial value problems for ordinary differential equations has become an active area of research. Recent developments in this area are surveyed with particular emphasis on traditional forwardstep methods that offer the potential for effective smallscale parallelism on existing machines.
On minimizing the maximum of two quadratic functions
Alexandr Halukov; Lyudmila Polyakova; Ninel Solomeychuk 2015 International Conference "Stability and Control Processes" in Memory of V.I. Zubov (SCP), 2015
The problem of minimizing the maximum of two strongly convex quadratic functions on Rn is considered. It is shown that in some cases this problem is equivalent to finding the positive root of a polynomial of the degree 2n or less.
On Matrix Multiplication Using Programmable Graph Architecture
Manish Kumar Shukla; A. Yavuz Oruc 2007 41st Annual Conference on Information Sciences and Systems, 2007
Recently, Tang et. al. introduced an algorithm called the programmable graph architecture (PGA) algorithm for multiplying matrices in GL(n,mu), the generalized linear group of matrices modulo mu, where mu is an integer, using its Cayley graph representation. The problem of multiplying matrices in GL(n,mu) is mapped to the problem of finding routes on a suitable Cayley graph representation of the ...
Dynamic scene analysis and the 8point algorithm
SuShing Chen [1988 Proceedings] 9th International Conference on Pattern Recognition, 1988
Some extended versions of the 8point algorithm of H.C. LonguetHiggins (1981, 1984) are presented. First, the algorithm is extended to (not necessarily rigid) affine transformations. Differentiable transformations are also discussed. Second, the solution of all the affine transformations for the 8point algorithm, given any point correspondences, is shown to have dimension 9r, where r is the rank of given point ...
More eLearning Resources
IEEE.tv Videos
IMS 2012 Microapps  RF System Design: Moving Beyond a Linear Datasheet
IMS 2011 Microapps  STAN Tool: A New Method for Linear and Nonlinear Stability Analysis of Microwave Circuits
A 20dBm Configurable Linear CMOS RF Power Amplifier for MultiStandard Transmitters: RFIC Industry Showcase
Codesign of Power Amplifier and Dynamic Power Supplies for Radar and Communications Transmitters
ProvablyCorrect Robot Control with LTLMoP, OMPL and ROS
Advances in Kernel Methods
Phase Retrieval with Application to Optical Imaging
WIE ILC 2015  Being Fearless: A Keynote with Patty Hatter of Intel
Interaction of ferromagnetic and superconducting permanent magnets  superconducting levitation
IMS 2014: Broadband Continuousmode Power Amplifiers
IEEE Themes  Efficient networking services underpin social networks
MicroApps 2013: Design Methodology for GaAs MMIC PA
Superconducting MAGLEV in Japan  ASC2014 Plenary series  13 of 13  Friday 2014/8/15
IEEE Magnetics 2014 Distinguished Lectures  JONATHAN COKER
MicroApps 2013: Breaking the RF Carrier Barrier  0 to 200 in Under a Second
Control of a FullyActuated Airship for Satellite Emulation
Quantum Computation  ASC2014 Plenary series  4 of 13  Tuesday 2014/8/12
Accelerating Machine Learning with NonVolatile Memory: Exploring device and circuit tradeoffs  Pritish Narayanan: 2016 International Conference on Rebooting Computing
MicroApps 2013: Design and Simulation of Phased Arrays in VSS
IEEEUSA EBooks

This chapter contains sections titled: 3.1 Hilbert Spaces, 3.2 Products and Tensor Products, 3.3 Matrices, 3.4 Complex Spaces and Inner Products, 3.5 Matrices, Graphs, and Sums Over Paths, 3.6 Problems, 3.7 Summary and Notes

Theoretical Background and Basic Inequalities
This chapter contains sections titled: A.1 Notation, A.2 Probability Theory, A.3 Functional Analysis and Linear Algebra, A.4 IllPosed Problems, A.5 Basic Inequalities

Boolean Functions, Quantum Bits, and Feasibility
This chapter contains sections titled: 4.1 Feasible Boolean Functions, 4.2 An Example, 4.3 Quantum Representation of Boolean Arguments, 4.4 Quantum Feasibility, 4.5 Problems, 4.6 Summary and Notes

This chapter contains sections titled: 11.1 Strategy, 11.2 Good Numbers, 11.3 Quantum Part of the Algorithm, 11.4 Analysis of the Quantum Part, 11.5 Probability of a Good Number, 11.6 Using a Good Number, 11.7 Continued Fractions, 11.8 Problems, 11.9 Summary and Notes

This chapter contains sections titled: Rotation of Axes Matrices Determinants

Fast Computation of Graph Kernels
Using extensions of linear algebra concepts to Reproducing Kernel Hilbert Spaces (RKHS), we define a unifying framework for random walk kernels on graphs. Reduction to a Sylvester equation allows us to compute many of these kernels in O(n3) worstcase time. This includes kernels whose previous worst case time complexity was O(n6), such as the geometric kernels of Gartner et al. [1] and the marginal graph kernels of Kashima et al. [2]. Our algebra in RKHS allow us to exploit sparsity in directed and undirected graphs more effectively than previous methods, yielding subcubic computational complexity when combined with conjugate gradient solvers or fixedpoint iterations. Experiments on graphs from bioinformatics and other application domains show that our algorithms are often more than 1000 times faster than existing approaches.

This chapter contains sections titled: 5.1 Hadamard Matrices, 5.2 Fourier Matrices, 5.3 Reversible Computation and Permutation Matrices, 5.4 Feasible Diagonal Matrices, 5.5 Reflections, 5.6 Problems, 5.7 Summary and Notes

A Parallel Linear Algebra Library for the Denelcor HEP
This chapter contains sections titled: Introduction, Algorithms Based on Modules, Structure of the Algorithms, Efficient Modules for the Denelcor REP, Library Issues, Performance, Acknowledgements, References

<p>This book is written for students, CAD system users and software developers who are interested in geometric continuitya notion needed in everyday practice of ComputerAided Design and also a hot subject of research. It contains a description of the classical geometric spline curves and a solid theoretical basis for various constructions of smooth surfaces. Textbooks on computer graphics usually cover the most basic and necessary information about spline curves and surfaces in order to explain simple algorithms. In textbooks on geometric design, one can find more details, more algorithms and more theory. This book teaches how various parts of the theory can be gathered together and turned into constructions of smooth curves and smooth surfaces of arbitrary topology.</p><p>The mathematical background needed to understand this book is similar to what is necessary to read other textbooks on geometric design; most of it is basic linear algebra and analys s. More advanced mathematical material is introduced using elementary explanations. Reading <i>Geometric Continuity of Curves and Surfaces</i> provides an excellent opportunity to recall and exercise necessary mathematical notions and it may be your next step towards better practice and higher understanding of design principles.</p>

Some Linear Algebra Fundamentals
This chapter contains sections titled: Notations and Definitions Operators and Functions Norms Decompositions MoorePenrose Pseudoinverse Idempotent Matrices Kronecker Algebra Isomorphism between Complex and Real Matrices Derivatives Inner Product GramSchmidt Orthogonalization Calculating the Roots of Polynomials Sensitivity of the Least Squares Solution Exercises Appendix
Jobs related to Linear algebra
Back to Top
Computer Science Researcher (Research Engineer I/II) ICL 543
Georgia Tech Research Institute (GTRI)

High Performance Computing Researcher SEAL 939
Georgia Tech Research Institute (GTRI)

Electrooptical Engineer/Scientist (Research Engineer/Scientist I/II) EOSL 1321
Georgia Tech Research Institute (GTRI)