<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-7A7FMX8B/f4c4170a-5280-4e17-9af3-2bac63d91f1a/PDF"><dcterms:extent>466 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:DOC-7A7FMX8B/9219b7b4-dc77-49b9-bf70-22ef832251bd/TEXT"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="1977-2026"><edm:begin xml:lang="en">1977</edm:begin><edm:end xml:lang="en">2026</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:DOC-7A7FMX8B"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-EE5UIE2V" /><dcterms:issued>1982</dcterms:issued><dc:creator>Bohte, Zvonimir</dc:creator><dc:creator>Grad, Janez</dc:creator><dc:format xml:lang="sl">letnik:6</dc:format><dc:format xml:lang="sl">številka:l</dc:format><dc:format xml:lang="sl">str. 43-54</dc:format><dc:identifier>ISSN:0350-5596</dc:identifier><dc:identifier>COBISSID_HOST:7534425</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-7A7FMX8B</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Slovene Society Informatika</dc:publisher><dcterms:isPartOf xml:lang="sl">Informatica (Ljubljana)</dcterms:isPartOf><dc:subject xml:lang="en">derivative of the determinant</dc:subject><dc:subject xml:lang="en">generalized eigenvalue problems</dc:subject><dc:subject xml:lang="en">Laguerre's method</dc:subject><dc:subject xml:lang="sl">Laguerrova metoda</dc:subject><dc:subject xml:lang="sl">matematika</dc:subject><dc:subject xml:lang="en">mathematics</dc:subject><dc:subject xml:lang="sl">Mullerjeva metoda</dc:subject><dc:subject xml:lang="en">Muller's method</dc:subject><dc:subject xml:lang="sl">Newtonova metoda</dc:subject><dc:subject xml:lang="en">Newton's method</dc:subject><dc:subject xml:lang="en">numerical analysis</dc:subject><dc:subject xml:lang="sl">numerična analiza</dc:subject><dc:subject xml:lang="sl">odvod determinante</dc:subject><dc:subject xml:lang="sl">posplošeni problem lastnih vrednosti</dc:subject><dcterms:temporal rdf:resource="1977-2026" /><dc:title xml:lang="sl">Algorithms for the solution of the generalized eigenvalue problem|</dc:title><dc:description xml:lang="sl">In this paper we deal with generalized eigenvalue problem of matrix ?$A(z)$? with elements which are polynomials of ?$z$?. The well known iterative methodsof Muller, Newton and Laguerre for finding the zeros of function ?$f(z) = {\rm det} A(z)$? are analyzed. Decompositions of the matrix ?$A(z)$? and its derivatives are introduced in order to simplify the computations of the values of ?$f(z)$? and its first and second derivatives. Comparative analysis gives some indicators about the rate of convergence, computer time and accuracy of the computed eigenvalues for each of the method used. The analysed methods proved generally to be stable, economical and easily applicable. Fortran subroutines and an example of main calling programme are added for Muller's and Laguerre's method which proved tyo be more efficient than Newton's</dc:description><dc:description xml:lang="sl">Obravnavamo numerično reševanje posplošenega problema lastnih vrednosti za matriko ?$A(z)$? z elementi, ki so polinomi spremenljivke ?$z$?. Primerjane so dobro znane iterativne metode Mullerja, Newtona in Laguerra za računanje ničel polinoma ?$f(z) = {\rm det} A(z)$?. Vrednosti polinoma ?$f(z)$? in njegovih odvodov so izračunane na osnovi razcepa matrike ?$A(z)$?. Primerjava metod daje vpogled v hitrost konvergence, porabljen računski čas in natančnost izračunanih lastnih vrednosti za vsako metodo posebej. Analizirane metode so vse računsko stabilne, ekonomične in enostavno uporabne. Podprogrami v fortranu in primer glavnega programa so dodani za Mullerjevo in Laguerrovo metodo, ki sta se izkazali za bolj učinkovito od Newtonove</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:DOC-7A7FMX8B"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:DOC-7A7FMX8B" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:DOC-7A7FMX8B/f4c4170a-5280-4e17-9af3-2bac63d91f1a/PDF" /><edm:rights rdf:resource="http://rightsstatements.org/vocab/InC/1.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Slovensko društvo Informatika</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:DOC-7A7FMX8B/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:DOC-7A7FMX8B" /></ore:Aggregation></rdf:RDF>