Books on the topic 'Linjär algoritm'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic 'Linjär algoritm.'
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.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
Currie, James D. The complexity of the simplex algorithm. [Ottawa]: Carleton University, Mathematics and Statistics, 1985.
Find full textSima, Vasile. Algorithms for linear-quadratic optimization. New York: M. Dekker, 1996.
Find full textKontoghiorghes, Erricos John. Parallel Algorithms for Linear Models. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4571-2.
Full textLee, P. Synthesizing linear-array algorithms from nested for loop algorithms. New York: Courant Institute of Mathematical Sciences, New York University, 1988.
Find full textI, Agoshkov V., and Shuti͡a︡ev V. P, eds. Sopri͡a︡zhennye uravnenii͡a︡ i algoritmy vozmushcheniĭ. Moskva: Akademii͡a︡ nauk SSSR, Otdel vychislitelʹnoĭ matematiki, 1986.
Find full textPanik, Michael J. Linear programming: Mathematics, theory and algorithms. Dordrecht: Kluwer Academic, 1996.
Find full textAbdullah, Jalaluddin. Fixed point algorithms for linear programming. Birmingham: University of Birmingham, 1992.
Find full textservice), SpringerLink (Online, ed. Max-linear Systems: Theory and Algorithms. London: Springer-Verlag London Limited, 2010.
Find full textLinear network optimization: Algorithms and codes. Cambridge, Mass: MIT Press, 1991.
Find full textPanik, Michael J., ed. Linear Programming: Mathematics, Theory and Algorithms. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-3434-7.
Full textButkovič, Peter. Max-linear Systems: Theory and Algorithms. London: Springer London, 2010. http://dx.doi.org/10.1007/978-1-84996-299-5.
Full textMishra, B. A linear time algorithm for finding an ambitus. New York: Courant Institute of Mathematical Sciences, New York University, 1989.
Find full textFang, Shu-Cherng. Linear optimization and extensions: Theory and algorithms. Englewood Cliffs, N.J: Prentice Hall, 1993.
Find full textThe linear ordering problem: Algorithms and applications. Berlin: Heldermann, 1985.
Find full textSpedicato, Emilio, ed. Computer Algorithms for Solving Linear Algebraic Equations. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-76717-3.
Full textNicol, David M. A multistage linear array assignment problem. Hampton, Va: ICASE, 1988.
Find full textPotential function methods for approximately solving linear programming problems: Theory and practice. Boston: Kluwer Academic Publishers, 2002.
Find full textLobo, M. Stability theorems concerning high order explicit algorithms for the linear advection equation. Cranfield, Eng: College of Aeronautics, Cranfield Institute of Technology, 1985.
Find full textArbel, Ami. Exploring interior-point linear programming: Algorithms and software. Cambridge, Mass: MIT Press, 1993.
Find full textEngquist, Bjorn. Fast wavelet based algorithms for linear evolution equations. Hampton, Va: Institute for Computer Applications in Science and Engineering, 1992.
Find full textEiguren, Jakoba. Soft-decision decoding algorithms for linear block codes. Manchester: University of Manchester, 1994.
Find full textKepner, Jeremy V. Graph algorithms in the language of linear algebra. Philadelphia: Society for Industrial and Applied Mathematics, 2011.
Find full textGoedecker, S. An efficient linear scaling algorithm for tight binding molecular dynamics. Ithaca, N.Y: Cornell Theory Center, Cornell University, 1994.
Find full textBiberdorf, Ė. A. Garantirovannai︠a︡ tochnostʹ sovremennykh algoritmov lineĭnoĭ algebry. Novosibirsk: Izd-vo SO RAN, 2006.
Find full textI, Agoshkov V., and Shuti͡a︡ev V. P, eds. Sopri͡a︡zhennye uravnenii͡a︡ i algoritmy vozmushcheniĭ v nelineĭnykh zadachakh matematicheskoĭ fiziki. Moskva: Akademii͡a︡ nauk SSSR, Otdel vychislitelʹnoĭ matematiki, 1991.
Find full textCrama, Yves. Boolean functions: Theory, algorithms, and applications. Cambridge: Cambridge University Press, 2011.
Find full textMorton, David P. An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling. Monterey, Calif: Naval Postgraduate School, 1994.
Find full textComputational techniques of the simplex method. Boston: Kluwer Academic Publishers, 2003.
Find full textAlgorithms for computer-aided design of linear microwave circuits. Boston: Artech House, 1990.
Find full textMurthy, C. Siva Ram. New parallel algorithms for direct solution of linear equations. New York: J. Wiley, 2000.
Find full textGolub, Gene H., and Paul Van Dooren, eds. Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-75536-1.
Full textNATO, Advanced Study Institute on Linear Algebra Digital Signal Processing and Parallel Algorithms (1988 Leuven Belgium). Numerical linear algebra, digital signal processing, and parallel algorithms. Berlin: Springer-Verlag, 1991.
Find full textCanada. Defence Research Establishment Atlantic. Least Squares Algorithm For Fitting Piecewise Linear Functions on Fixed Domains. S.l: s.n, 1985.
Find full textBlair, Charles. The iterative step in the linear programming algorithm of N. Karmarkar. [Urbana, Ill.]: College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1985.
Find full textI, Agoshkov V., and Shuti͡a︡ev V. P, eds. Adjoint equations and perturbation algorithms in nonlinear problems. Boca Raton, Fla: CRC Press, 1996.
Find full textK, Godunov S., ed. Vvedenie v vychislitelʹnui͡u︡ lineĭnui͡u︡ algebru: S prilozheniem algoritmov na FORTRANe. Novosibirsk: Nauka, Sibirskoe otd-nie, 1991.
Find full textKlerk, Etienne de. Aspects of semidefinite programming: Interior point algorithms and selected applications. New York: Springer, 2011.
Find full textMersini, 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. Tirane: VEFA, 1996.
Find full textKreiner, Svend. Collapsibility of multidimensional contingency tables: Theorems, algorithms, and programs. [Copenhagen, Denmark]: Danish Institute for Educational Research, 1987.
Find full textVan Landingham, Hugh F., 1935-, ed. Algorithms for computer-aided design of multivariable control systems. New York: M. Dekker, 1993.
Find full textKoenker, Roger W. An interior point algorithm for nonlinear quantile regression / Roger Koenker ; Beum J. Park. Champaign: University of Illinois at Urbana-Champaign, 1992.
Find full textSmith, Fraser B. Mixed model analyses of censored normal distributions via the EM algorithm. Chapel Hill, N.C: Dept. of Biostatistics, Univ. of North Carolina at Chapel Hill, 1992.
Find full textTamás, Terlaky, Vial J. P, and Roos Cornelis 1941-, eds. Interior point methods for linear optimization. 2nd ed. New York: Springer, 2006.
Find full textBultheel, Adhemar. Linear algebra, rational approximation, and orthogonal polynomials. Amsterdam: Elsevier, 1997.
Find full textPovitsky, Alex. Wavefront cache-friendly algorithm for compact numerical schemes. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1999.
Find full textGraham, Ronald E. Linearization of digital derived rate algorithm for use in linear stability analysis. [Washington, DC?]: National Aeronautics and Space Administration, 1985.
Find full textEdelsbrunner, Herbert. The upper envelope of piecewise linear functions: algorithms and applications. New York: Courant Institute of Mathematical Sciences, New York University, 1987.
Find full textBisseling, Rob H. Parallel Scientific Computation. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198788348.001.0001.
Full text