{"id":"https://openalex.org/W2295109615","doi":"https://doi.org/10.4230/oasics.scor.2012.64","title":"Product Form of the Inverse Revisited","display_name":"Product Form of the Inverse Revisited","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2295109615","doi":"https://doi.org/10.4230/oasics.scor.2012.64","mag":"2295109615"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:3547","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.64","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/oasics.scor.2012.64","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078153945","display_name":"P\u00e9ter Tar","orcid":null},"institutions":[{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Tar, P\u00e9ter","raw_affiliation_strings":["University of Pann\u00f3nia"],"affiliations":[{"raw_affiliation_string":"University of Pann\u00f3nia","institution_ids":["https://openalex.org/I140275651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006704213","display_name":"Istv\u00e1n Maros","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maros, Istv\u00e1n","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078153945"],"corresponding_institution_ids":["https://openalex.org/I140275651"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23064947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"22","issue":null,"first_page":"64","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9366000294685364,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6742209792137146},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.6048409342765808},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5887106657028198},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.563724160194397},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5119231939315796},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5023388862609863},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.49677711725234985},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.49012860655784607},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4879262149333954},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.46182021498680115},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.453857958316803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4418973922729492},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37563982605934143},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.31749796867370605}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6742209792137146},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.6048409342765808},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5887106657028198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.563724160194397},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5119231939315796},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5023388862609863},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.49677711725234985},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.49012860655784607},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4879262149333954},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.46182021498680115},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.453857958316803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4418973922729492},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37563982605934143},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.31749796867370605},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:3547","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.64","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/oasics.scor.2012.64","is_oa":true,"landing_page_url":"https://doi.org/10.4230/oasics.scor.2012.64","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2295109615","is_oa":false,"landing_page_url":"http://drops.dagstuhl.de/opus/volltexte/2012/3547/pdf/8.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.4230/oasics.scor.2012.64","is_oa":true,"landing_page_url":"https://doi.org/10.4230/oasics.scor.2012.64","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":""},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1575307352","https://openalex.org/W1586233612","https://openalex.org/W1973752298","https://openalex.org/W2017950741","https://openalex.org/W2087830284","https://openalex.org/W2118382442","https://openalex.org/W2152471993"],"related_works":["https://openalex.org/W2071538629","https://openalex.org/W2102812372","https://openalex.org/W2030246377","https://openalex.org/W1838013853","https://openalex.org/W2589995988","https://openalex.org/W2966944907","https://openalex.org/W3015510172","https://openalex.org/W3173804021","https://openalex.org/W3177733801","https://openalex.org/W2769646558","https://openalex.org/W1569969230","https://openalex.org/W115737931","https://openalex.org/W2619643458","https://openalex.org/W2164784865","https://openalex.org/W2187224761","https://openalex.org/W3088037699","https://openalex.org/W2080170989","https://openalex.org/W2294894645","https://openalex.org/W3102018812","https://openalex.org/W2135125331"],"abstract_inverted_index":{"Using":[0],"the":[1,8,24,43,63,66,70,79,92,97,119,147,150,154,170,179,182],"simplex":[2],"method":[3,81],"(SM)":[4],"is":[5,26,30,37,82,145],"one":[6],"of":[7,12,23,42,69,94,135,142,149,153,181],"most":[9],"effective":[10],"ways":[11],"solving":[13],"large":[14],"scale":[15],"real":[16],"life":[17],"linear":[18],"optimization":[19],"problems.":[20],"The":[21,28,140,160,172],"efficiency":[22],"solver":[25],"crucial.":[27],"SM":[29],"an":[31],"iterative":[32],"procedure,":[33],"where":[34],"each":[35],"iteration":[36],"defined":[38],"by":[39],"a":[40,123],"basis":[41,53],"constraint":[44],"set.":[45],"In":[46,114],"order":[47,108],"to":[48,109],"speed":[49],"up":[50],"iterations,":[51],"proper":[52],"handling":[54],"procedures":[55],"must":[56],"be":[57,89],"applied.":[58],"Two":[59],"methodologies":[60],"exist":[61],"in":[62,107,146,169],"state-of-the-art":[64],"literature,":[65],"product":[67],"form":[68],"inverse":[71],"(PFI)":[72],"and":[73,121],"lower-upper":[74],"triangular":[75],"(LU)":[76],"factorization.":[77],"Nowadays":[78],"LU":[80],"widely":[83],"used":[84],"because":[85],"120-150":[86],"iterations":[87,104,136],"can":[88,99,127,174],"done":[90],"without":[91,105,137],"need":[93],"refactorization":[95],"while":[96],"PFI":[98,120,162],"make":[100,128],"only":[101],"about":[102],"30-60":[103],"reinversion":[106],"maintain":[110],"acceptable":[111],"numerical":[112],"accuracy.":[113,139],"this":[115],"paper":[116],"we":[117],"revisit":[118],"present":[122],"new":[124,161,176],"version":[125],"that":[126],"hundreds":[129],"or":[130],"sometimes":[131],"even":[132],"few":[133],"thousands":[134],"losing":[138],"novelty":[141],"our":[143],"approach":[144],"processing":[148],"non-triangular":[151],"part":[152],"basis,":[155],"based":[156],"on":[157,178],"block-triangularization":[158],"algorithms.":[159],"performs":[163],"much":[164],"better":[165],"than":[166],"those":[167],"found":[168],"literature.":[171],"results":[173],"shed":[175],"light":[177],"usefulness":[180],"PFI.":[183]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}