{"_id":"YcREXGHD7sHw7HnXc","bibbaseid":"alemazkoor-meidani-divideandconqueranincrementalsparsitypromotingcompressivesamplingapproachforpolynomialchaosexpansions-2017","author_short":["Alemazkoor, N.","Meidani, H."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Negin"],"propositions":[],"lastnames":["Alemazkoor"],"suffixes":[]},{"firstnames":["Hadi"],"propositions":[],"lastnames":["Meidani"],"suffixes":[]}],"title":"Divide and conquer: An incremental sparsity promoting compressive sampling approach for polynomial chaos expansions","year":"2017","bibtex":"@article{1,\n author = {Negin Alemazkoor and Hadi Meidani},\n title = {Divide and conquer: An incremental sparsity promoting compressive sampling approach for polynomial chaos expansions},\n year = {2017}\n}\n\n","author_short":["Alemazkoor, N.","Meidani, H."],"key":"1","id":"1","bibbaseid":"alemazkoor-meidani-divideandconqueranincrementalsparsitypromotingcompressivesamplingapproachforpolynomialchaosexpansions-2017","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/f/QuW9NyeKMp6Cj3mam/Link_Lab_Publications.bib","dataSources":["GXL8BuKffZ6XGRvhu","zTwdZBrCqogZ6yMmD","A9Zuq8B85Rd3bHeNs","zq8E4CA9zBjkA2p7P","b7zvHnuSqhTvwNoon","oJrPzgJNhsXm5syNJ","BE493TFz6wWiE9NkC","BT3X3GwZkCpNDfran","6CYcgzsh5rhZhtcXe","wjuM2yjE6FYvwqbTY","368YB8BLqs37k2ZQS","HqgW9guPMeWcQ3qDt","yw3rEahzQ3eYTSc9r","DesgNCELw9F4LSokr","WCSuxR2upo4FXxxRm","JSGNr3KwokFPgXiz5","RbCkvcfqfbgtxTyNT","mwAui9iKniQyhTc49","m6hDbtiptxFxNGk8y","Kg2u32BaLYeEZkT9t"],"keywords":[],"search_terms":["divide","conquer","incremental","sparsity","promoting","compressive","sampling","approach","polynomial","chaos","expansions","alemazkoor","meidani"],"title":"Divide and conquer: An incremental sparsity promoting compressive sampling approach for polynomial chaos expansions","year":2017}