{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3549784","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3549784","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3549784","kernelVersion":"v1","immutable":true,"modified":"2026-04-04T05:47:02Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3549784","name":"A domain decomposition strategy to efficiently solve structures containing repeated patterns","headline":"A domain decomposition strategy to efficiently solve structures containing repeated patterns","description":"scientific article; zbMATH DE number 5687354","url":"https://portal.mardi4nfdi.de/entity/Q3549784","datePublished":"2010-03-29","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q460857"},{"@id":"https://portal.mardi4nfdi.de/entity/Q459336"},{"@id":"https://portal.mardi4nfdi.de/entity/Q460856"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2709671"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1002/NME.2517","url":"https://doi.org/10.1002/NME.2517"},"sameAs":["https://doi.org/10.1002/NME.2517"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4303877"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2709672"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1026893"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1420887"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3418164"}]},"provenance":{"prov:generatedAtTime":"2026-04-04T05:47:02Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}