{"title":"机动车碰撞受害者计算机仿真的预处理技术","authors":"B. Dimitriadis, P. Groumpos","doi":"10.1109/VTC.1978.1622565","DOIUrl":null,"url":null,"abstract":"Methods of solution of algebraic equations generated by current computer simulation schemes for motorvehicle crash victims are reviewed. Preprocessing techniques, usually found in the literature applied in other areas, are for the first time applied in this problem. Thus, a favorable matrix structure, is generated. Using inherent symmetries present in the above models under certain circumstances the coefficient matrices of the generated sets of equations are transformed into block-arrow forms. For the inversion of those forms, a fast algorithm is provided. When perturbation, symmetric or not, is generated, the matrix partitioning technique has been applied reducing the problem into two parts: a) One easily solvable by the above proposed fast block-arrow form inversion algorithm and b) a very low-order one (including actually only the perturbation, which can be solved readily by any usual technique. We can proceed in this Way, to the solution of very large-dimensional problems, in a very fast and accurate fashion.","PeriodicalId":264799,"journal":{"name":"28th IEEE Vehicular Technology Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Preprocessing techniques on computer simulation of motorvehicle crash victims\",\"authors\":\"B. Dimitriadis, P. Groumpos\",\"doi\":\"10.1109/VTC.1978.1622565\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Methods of solution of algebraic equations generated by current computer simulation schemes for motorvehicle crash victims are reviewed. Preprocessing techniques, usually found in the literature applied in other areas, are for the first time applied in this problem. Thus, a favorable matrix structure, is generated. Using inherent symmetries present in the above models under certain circumstances the coefficient matrices of the generated sets of equations are transformed into block-arrow forms. For the inversion of those forms, a fast algorithm is provided. When perturbation, symmetric or not, is generated, the matrix partitioning technique has been applied reducing the problem into two parts: a) One easily solvable by the above proposed fast block-arrow form inversion algorithm and b) a very low-order one (including actually only the perturbation, which can be solved readily by any usual technique. We can proceed in this Way, to the solution of very large-dimensional problems, in a very fast and accurate fashion.\",\"PeriodicalId\":264799,\"journal\":{\"name\":\"28th IEEE Vehicular Technology Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"28th IEEE Vehicular Technology Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VTC.1978.1622565\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"28th IEEE Vehicular Technology Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTC.1978.1622565","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Preprocessing techniques on computer simulation of motorvehicle crash victims
Methods of solution of algebraic equations generated by current computer simulation schemes for motorvehicle crash victims are reviewed. Preprocessing techniques, usually found in the literature applied in other areas, are for the first time applied in this problem. Thus, a favorable matrix structure, is generated. Using inherent symmetries present in the above models under certain circumstances the coefficient matrices of the generated sets of equations are transformed into block-arrow forms. For the inversion of those forms, a fast algorithm is provided. When perturbation, symmetric or not, is generated, the matrix partitioning technique has been applied reducing the problem into two parts: a) One easily solvable by the above proposed fast block-arrow form inversion algorithm and b) a very low-order one (including actually only the perturbation, which can be solved readily by any usual technique. We can proceed in this Way, to the solution of very large-dimensional problems, in a very fast and accurate fashion.