Log in

Relevant bibliographies by topics / Algebras, Linear Algorithms

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Algebras, Linear Algorithms'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algebras, Linear Algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algebras, Linear Algorithms"

1

Chyzak, F., A. Quadrat, and D. Robertz. "Effective algorithms for parametrizing linear control systems over Ore algebras." Applicable Algebra in Engineering, Communication and Computing 16, no. 5 (2005): 319–76. http://dx.doi.org/10.1007/s00200-005-0188-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Faybusovich, Leonid. "Linear systems in Jordan algebras and primal-dual interior-point algorithms." Journal of Computational and Applied Mathematics 86, no. 1 (1997): 149–75. http://dx.doi.org/10.1016/s0377-0427(97)00153-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Sayadi Shahraki, Marzieh, Maryam Zangiabadi та Hossein Mansouri. "A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones". Asian-European Journal of Mathematics 09, № 03 (2016): 1650049. http://dx.doi.org/10.1142/s1793557116500492.

Full text

Abstract:

In this paper, we present a predictor–corrector infeasible-interior-point method based on a new wide neighborhood of the central path for linear complementarity problem over symmetric cones (SCLCP) with the Cartesian [Formula: see text]-property. The convergence of the algorithm is proved for commutative class of search directions. Moreover, using the theory of Euclidean Jordan algebras and some elegant tools, the iteration bound improves the earlier complexity of these kind of algorithms for the Cartesian [Formula: see text]-SCLCPs.

APA, Harvard, Vancouver, ISO, and other styles

4

Chyzak, F., A. Quadrat, and D. Robertz. "Linear control systems over ore algebras: Effective algorithms for the computation of parametrizations." IFAC Proceedings Volumes 36, no. 19 (2003): 147–54. http://dx.doi.org/10.1016/s1474-6670(17)33317-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wani Jamaludin, Irma Wani Jamaludin, and Norhaliza Abdul Wahab. "Recursive Subspace Identification Algorithm using the Propagator Based Method." Indonesian Journal of Electrical Engineering and Computer Science 6, no. 1 (2017): 172. http://dx.doi.org/10.11591/ijeecs.v6.i1.pp172-179.

Full text

Abstract:

<p>Subspace model identification (SMI) method is the effective method in identifying dynamic state space linear multivariable systems and it can be obtained directly from the input and output data. Basically, subspace identifications are based on algorithms from numerical algebras which are the QR decomposition and Singular Value Decomposition (SVD). In industrial applications, it is essential to have online recursive subspace algorithms for model identification where the parameters can vary in time. However, because of the SVD computational complexity that involved in the algorithm, the

APA, Harvard, Vancouver, ISO, and other styles

6

JAMIOŁKOWSKI, ANDRZEJ. "ON APPLICATIONS OF PI-ALGEBRAS IN THE ANALYSIS OF QUANTUM CHANNELS." International Journal of Quantum Information 10, no. 08 (2012): 1241007. http://dx.doi.org/10.1142/s0219749912410079.

Full text

Abstract:

In this paper, we discuss some constructive procedures which can be used in characterizations of linear transformations which preserve the set of states of a fixed quantum system. Our methods are based on analyzing an explicit form of a linear positive map in its Kraus representation. In particular, we discuss the so-called partial commutativity of operators and its applications to investigation of decoherence-free subspaces. These subspaces can also be considered as a special class of quantum error correcting codes. Using the concept of standard polynomials and Amitsur–Levitzki theorem and ot

APA, Harvard, Vancouver, ISO, and other styles

7

Bluman, G. W., and S. Kumei. "Symmetry-based algorithms to relate partial differential equations: I. Local symmetries." European Journal of Applied Mathematics 1, no. 3 (1990): 189–216. http://dx.doi.org/10.1017/s0956792500000176.

Full text

Abstract:

Simple and systematic algorithms for relating differential equations are given. They are based on comparing the local symmetries admitted by the equations. Comparisons of the infinitesimal generators and their Lie algebras of given and target equations lead to necessary conditions for the existence of mappings which relate them. Necessary and sufficient conditions are presented for the existence of invertible mappings from a given nonlinear system of partial differential equations to some linear system of equations with examples including the hodograph and Legendre transformations, and the lin

APA, Harvard, Vancouver, ISO, and other styles

8

Chen, Chin Chun, Yuan Horng Lin, Jeng Ming Yih, and Sue Fen Huang. "Construct Knowledge Structure of Linear Algebra." Advanced Materials Research 211-212 (February 2011): 793–97. http://dx.doi.org/10.4028/www.scientific.net/amr.211-212.793.

Full text

Abstract:

Apply interpretive structural modeling to construct knowledge structure of linear algebra. New fuzzy clustering algorithms improved fuzzy c-means algorithm based on Mahalanobis distance has better performance than fuzzy c-means algorithm. Each cluster of data can easily describe features of knowledge structures individually. The results show that there are six clusters and each cluster has its own cognitive characteristics. The methodology can improve knowledge management in classroom more feasible.

APA, Harvard, Vancouver, ISO, and other styles

9

Demmel, James, Ioana Dumitriu, Olga Holtz, and Plamen Koev. "Accurate and efficient expression evaluation and linear algebra." Acta Numerica 17 (April 25, 2008): 87–145. http://dx.doi.org/10.1017/s0962492906350015.

Full text

Abstract:

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By ‘accurate’ we mean that the computed answer has relative error less than 1, i.e., has some correct leading digits. We also address efficiency, by which we mean algorithms that run in polynomial time in the size of the input. Our results will depend strongly on the model of arithmetic: most of our results will use the so-called traditional model (TM), where the computed result of op(a, b), a bina

APA, Harvard, Vancouver, ISO, and other styles

10

Fabregat-Traver, Diego, and Paolo Bientinesi. "Application-tailored linear algebra algorithms." International Journal of High Performance Computing Applications 27, no. 4 (2013): 426–39. http://dx.doi.org/10.1177/1094342013494428.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Algebras, Linear Algorithms"

1

Gunnels, John Andrew. "A systematic approach to the design and analysis of linear algebra algorithms." Access restricted to users with UT Austin EID Full text (PDF) from UMI/Dissertation Abstracts International, 2001. http://wwwlib.umi.com/cr/utexas/fullcit?p3037015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Porter, Annabelle Louise. "The evolution of equation-solving: Linear, quadratic, and cubic." CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3069.

Full text

Abstract:

This paper is intended as a professional developmental tool to help secondary algebra teachers understand the concepts underlying the algorithms we use, how these algorithms developed, and why they work. It uses a historical perspective to highlight many of the concepts underlying modern equation solving.

APA, Harvard, Vancouver, ISO, and other styles

3

Wu, Wenhao. "High-performance matrix multiplication hierarchical data structures, optimized kernel routines, and qualitative performance modeling /." Master's thesis, Mississippi State : Mississippi State University, 2003. http://library.msstate.edu/etd/show.asp?etd=etd-07092003-003633.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Rocha, Eugénio Alexandre Miguel. "Uma Abordagem Algébrica à Teoria de Controlo Não Linear." Doctoral thesis, Universidade de Aveiro, 2003. http://hdl.handle.net/10773/21444.

Full text

Abstract:

Doutoramento em Matemática<br>Nesta tese de Doutoramento desenvolve-se principalmente uma abordagem algébrica à teoria de sistemas de controlo não lineares. No entanto, outros tópicos são também estudados. Os tópicos tratados são os seguidamente enunciados: fórmulas para sistemas de controlo sobre álgebras de Lie livres, estabilidade de um sistema de corpos rolantes, algoritmos para aritmética digital, e equações integrais de Fredholm não lineares. No primeiro e principal tópico estudam-se representações para as soluções de sistemas de controlo lineares no controlo. As suas trajetórias

APA, Harvard, Vancouver, ISO, and other styles

5

Yelkenci, Serhat. "Algorithmic Music Composition Using Linear Algebra." Thesis, Southern Illinois University at Edwardsville, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10275073.

Full text

Abstract:

<p> Sound, in its all forms, is a source of energy whose capabilities humankind is not yet fully aware of. Composition - the way of aggregating sounds into the form of music - still holds to be an unperceived methodology with lots of unknowns. Methodologies used by composers are generally seem as being innate talent, something that cannot be used or shared by others. Yet, as any other form of art, music actually is and can be interpreted with mathematics and geometry. The focus of this thesis is to propose a generative algorithm to compose structured music pieces using linear algebra as the ma

APA, Harvard, Vancouver, ISO, and other styles

6

Delaplace, Claire. "Algorithmes d'algèbre linéaire pour la cryptographie." Thesis, Rennes 1, 2018. http://www.theses.fr/2018REN1S045/document.

Full text

Abstract:

Dans cette thèse, nous discutons d’aspects algorithmiques de trois différents problèmes, en lien avec la cryptographie. La première partie est consacrée à l’algèbre linéaire creuse. Nous y présentons un nouvel algorithme de pivot de Gauss pour matrices creuses à coefficients exacts, ainsi qu’une nouvelle heuristique de sélection de pivots, qui rend l’entière procédure particulièrement efficace dans certains cas. La deuxième partie porte sur une variante du problème des anniversaires, avec trois listes. Ce problème, que nous appelons problème 3XOR, consiste intuitivement à tro

APA, Harvard, Vancouver, ISO, and other styles

7

Weihrauch, Christian. "Analysis of Monte Carlo algorithms for linear algebra problems." Thesis, University of Reading, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.515747.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Iakymchuk, Roman [Verfasser]. "Performance modeling and prediction for linear algebra algorithms / Roman Iakymchuk." Aachen : Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen, 2012. http://d-nb.info/1026308690/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sato, Hiroyuki. "Riemannian Optimization Algorithms and Their Applications to Numerical Linear Algebra." 京都大学 (Kyoto University), 2013. http://hdl.handle.net/2433/180615.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Maust, Reid S. "Optimal power flow using a genetic algorithm and linear algebra." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1163.

Full text

Abstract:

Thesis (Ph. D.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains vi, 91 p. : ill. Vita. Includes abstract. Includes bibliographical references (p. 41-42).

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Algebras, Linear Algorithms"

1

service), SpringerLink (Online, ed. Max-linear Systems: Theory and Algorithms. Springer-Verlag London Limited, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kepner, Jeremy V. Graph algorithms in the language of linear algebra. Society for Industrial and Applied Mathematics, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mersini, Nexhat. Sparse matrices of high order: Algorythms for reordering, inversion and solution of systems of linear equations = Matrica te rralla te rendeve te larta : algoritme per aranzhimin, inversimin dhe zgjidhjen e sistemeve te ekuacioneve lineare. VEFA, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Van Landingham, Hugh F., 1935-, ed. Algorithms for computer-aided design of multivariable control systems. M. Dekker, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

NATO, Advanced Study Institute on Linear Algebra Digital Signal Processing and Parallel Algorithms (1988 Leuven Belgium). Numerical linear algebra, digital signal processing, and parallel algorithms. Springer-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Svetozar, Margenov, ed. Robust algebraic multilevel methods and algorithms. Walter De Gruyter, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

NATO Advanced Study Institute on Computer Algorithms for Solving Linear Equations: the State of the Art (1990 Il Ciocco, Italy). Computer algorithms for solving linear algebraic equations: The state of the art. Springer-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

NATO Advanced Study Institute on Computer Algorithms for Solving Linear Equations: the State of the Art (1990 Il Ciocco, Italy). Computer algorithms for solving linear algebraic equations: The state of the art. Springer-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wrixon, Adrian. D-A converter test optimisation. University College Dublin, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

service), SpringerLink (Online, ed. The Linear Algebra a Beginning Graduate Student Ought to Know. 3rd ed. Springer Netherlands, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Algebras, Linear Algorithms"

1

Dostál, Zdenek. "Linear Algebra." In Optimal Quadratic Programming Algorithms. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-84806-8_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dostál, Zdeněk, and Tomáš Kozubek. "Linear Algebra." In Scalable Algorithms for Contact Problems. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-6834-3_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Oliveira, Carlos. "Linear Algebra Algorithms." In Options and Derivatives Programming in C++20. Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-6315-0_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Oliveira, Carlos. "Linear Algebra Algorithms." In Options and Derivatives Programming in C++. Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-1814-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Winkler, Franz. "Linear algebra—solving linear systems." In Polynomial Algorithms in Computer Algebra. Springer Vienna, 1996. http://dx.doi.org/10.1007/978-3-7091-6571-3_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Poloni, Federico. "Linear algebra preliminaries." In Algorithms for Quadratic Matrix and Vector Equations. Scuola Normale Superiore, 2011. http://dx.doi.org/10.1007/978-88-7642-384-0_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Barg, Alexander. "Minimun distance decoding algorithms for linear codes." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63163-1_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Fripertinger, Harald, and Adalbert Kerber. "Isometry classes of indecomposable linear codes." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60114-7_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Greferath, M., and S. E. Schmidt. "Linear Codes and Rings of Matrices." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46796-3_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Janiszczak, Ingo, Reinhard Knörr, and Gerhard O. Michler. "Gauß’scher Algorithmus." In Lineare Algebra für Wirtschaftsinformatiker. Vieweg+Teubner Verlag, 1992. http://dx.doi.org/10.1007/978-3-322-84176-6_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algebras, Linear Algorithms"

1

Pernet, Clément. "Exact Linear Algebra Algorithmic." In ISSAC'15: International Symposium on Symbolic and Algebraic Computation. ACM, 2015. http://dx.doi.org/10.1145/2755996.2756684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hubay, Csanád Árpád, and Tamás Kalmár-Nagy. "Computing Poincaré-Lyapunov Constants via Carleman Linearization." In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-98413.

Full text

Abstract:

Abstract Using Carleman linearization an approximation is given for the solution of a system at Hopf bifurcation. The values of the Poincaré-Lyapunov constants (whether they are zero or not) affect the linear algebraic properties of the Carleman matrix and they appear in solvability conditions (through the Fredholm alternative). We provide a linear algebra based algorithm to compute the Poincaré-Lyapunov constants.

APA, Harvard, Vancouver, ISO, and other styles

3

"UNREVEALING BIOLOGICAL PROCESS WITH LINEAR ALGEBRA - Extracting Patterns from Noisy Data." In International Conference on Bioinformatics Models, Methods and Algorithms. SciTePress - Science and and Technology Publications, 2011. http://dx.doi.org/10.5220/0003164103130317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zhang, Shaoshuai, Vivek Karihaloo, and Panruo Wu. "Basic Linear Algebra Operations on TensorCore GPU." In 2020 IEEE/ACM 11th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA). IEEE, 2020. http://dx.doi.org/10.1109/scala51936.2020.00011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Cheung, Ho Yee, Lap Chi Lau, and Kai Man Leung. "Algebraic Algorithms for Linear Matroid Parity Problems." In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2011. http://dx.doi.org/10.1137/1.9781611973082.105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Davila, Diego, Vassil Alexandrov, and Oscar A. Esquivel-Flores. "On Monte Carlo Hybrid Methods for Linear Algebra." In 2016 7th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA). IEEE, 2016. http://dx.doi.org/10.1109/scala.2016.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Xu, Guanglei, and William S. Oates. "Can Quantum Computers Solve Linear Algebra Problems to Advance Engineering Applications?" In ASME 2018 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/smasis2018-8087.

Full text

Abstract:

Since its inception by Richard Feynman in 1982, quantum computing has provided an intriguing opportunity to advance computational capabilities over classical computing. Classical computers use bits to process information in terms of zeros and ones. Quantum computers use the complex world of quantum mechanics to carry out calculations using qubits (the quantum analog of a classical bit). The qubit can be in a superposition of the zero and one state simultaneously unlike a classical bit. The true power of quantum computing comes from the complexity of entanglement between many qubits. When entan

APA, Harvard, Vancouver, ISO, and other styles

8

Eijkhout, Victor, and Erika Fuentes. "Multi-stage Learning of Linear Algebra Algorithms." In 2008 Seventh International Conference on Machine Learning and Applications. IEEE, 2008. http://dx.doi.org/10.1109/icmla.2008.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Casasent, David. "Optical Linear Algebra Processors: Architectures and Algorithms." In O-E/LASE'86 Symp (January 1986, Los Angeles), edited by Keith Bromley. SPIE, 1986. http://dx.doi.org/10.1117/12.960506.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Tinnirello, Alicia María, Eduardo Alberto Gago, and Paola Andrea Szekieta. "ALGORITHMIC MATHEMATICS IN LINEAR ALGEBRA APPLICATIONS." In 12th International Technology, Education and Development Conference. IATED, 2018. http://dx.doi.org/10.21125/inted.2018.1738.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algebras, Linear Algorithms"

1

Martín, A., L. Cirrottola, A. Froehly, R. Rossi, and C. Soriano. D2.2 First release of the octree mesh-generation capabilities and of the parallel mesh adaptation kernel. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.010.

Full text

Abstract:

This document presents a description of the octree mesh-generation capabilities and of the parallel mesh adaptation kernel. As it is discussed in Section 1.3.2 of part B of the project proposal there are two parallel research lines aimed at developing scalable adaptive mesh refinement (AMR) algorithms and implementations. The first one is based on using octree-based mesh generation and adaptation for the whole simulation in combination with unfitted finite element methods (FEMs) and the use of algebraic constraints to deal with non-conformity of spaces. On the other hand the second strategy is

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!